Optimization Letters

, Volume 7, Issue 3, pp 613–616

A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times

Open Access
Short Communication

Abstract

In this paper, we show that the strong NP-hardness proof of the single machine makespan minimization problem with ready times and job processing times described by a non-increasing power function dependent on a job position in a sequence presented in Bachman and Janiak (J Oper Res Soc 55:257–264, 2004) is incorrect. Namely, the applied transformation from 3- Partition problem to the considered scheduling problem is polynomial not pseudopolynomial. Thus, the related problem is NP-hard, but it is not proved to be strongly NP-hard.

Keywords

Computational analysis Strong NP-hardness Scheduling Learning effect Position-dependent processing time 

References

  1. 1.
    Bachman A., Janiak A.: Scheduling jobs with position dependent processing times. J. Oper. Res. Soc. 55, 257–264 (2004)MATHCrossRefGoogle Scholar
  2. 2.
    Farhi B., Kane D.: New results on the least common multiple of consecutive integers. P. Am. Math. Soc. 137, 1933–1939 (2009)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  4. 4.
    Hardy G.H., Wright E.M.: An Introduction to the Theory of Numbers. Oxford University Press, New York (1979)MATHGoogle Scholar
  5. 5.
    Lee C.-Y., Vairaktarkis G.: Complexity of single machine hierarchical scheduling: a survey. In: Pardalos, P.M. (eds) Complexity in Numerical Optimization, pp. 269–298. World Scientific, Singapore (1993)CrossRefGoogle Scholar
  6. 6.
    Pardalos P.M., Resende M.: Combinatorial optimization. In: Pardalos, P.M., Resende, M. (eds) Handbook of Applied Optimization, pp. 51–52. Oxford University Press, Oxford (2002)Google Scholar

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.Wrocław University of EconomicsWrocławPoland

Personalised recommendations