Abstract
This note presents complexity results for a single-machine scheduling problem of minimizing the number of late jobs. In the studied problem, the processing times of the jobs are defined by positional learning effects. A recent paper proposed a polynomial time algorithm for the case with a common due date and conjectured the general problem to be π©π«-hard. We confirm that the general problem is strongly π©π«-hard and show that the studied problem remains π©π«-hard even if there are only two different due-date values.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: Review and extensions. J Opl Res Soc 50: 711β720.
Cheng TCE, Ding Q and Lin BMT (2003). A concise survey of scheduling with time-dependent processing times. Eur J Opl Res 152: 1β13.
Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of 𝒩𝒫-Completeness. Freedman: San Francisco, CA.
Mosheiov G and Sidney JB (2005). Note on scheduling with general learning curves to minimize the number of tardy jobs. J Opl Res Soc 56: 110β112.
Acknowledgements
I thank Professor Gur Mosheiov for introducing the studied problem and two anonymous referees for pinpointing some typos and unclarified points in an earlier version of this paper. The author is partially supported by a Taiwan-Russia joint project under grant NSC-94-2416-H-009-013 (Taiwan) and RP05H01 (05-06-90606-HHCa, Russia).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lin, B. Complexity results for single-machine scheduling with positional learning effects. J Oper Res Soc 58, 1099β1102 (2007). https://doi.org/10.1057/palgrave.jors.2602227
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602227