Advertisement

Journal of Scheduling

, Volume 16, Issue 4, pp 437–438 | Cite as

A note on the paper “Minimizing total tardiness on parallel machines with preemptions” by Kravchenko and Werner (2012)

  • D. ProtEmail author
  • O. Bellenguez-Morineau
  • C. Lahlou
Article

Abstract

In this note, we point out two major errors in the paper “Minimizing total tardiness on parallel machines with preemptions” by Kravchenko and Werner (2012). More precisely, they claimed to have proved that both problems P|pmtn|∑T j and P|r j ,p j =p,pmtn|∑T j are \(\mathcal{NP}\)-Hard. We give a counter-example to their proofs, letting the complexity of these two problems open.

Keywords

Scheduling Complexity Identical machines Preemptive problems Total tardiness 

References

  1. Kravchenko, S. A., & Werner, F. (2012). Minimizing total tardiness on parallel machines with preemptions. Journal of Scheduling, 15(2), 193–200. doi: 10.1007/s10951-010-0198-5. CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.École des Mines de Nantes, IRCCyN UMR CNRS 6597 (Institut de Recherche en Communication et en Cybernétique de Nantes)LUNAM UniversitéNantes Cedex 3France

Personalised recommendations