Note on scheduling with general learning curves to minimize the number of tardy jobs

G. Mosheiov*, J. B. Sidney

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

68 Scopus citations

Abstract

Several research studies have confirmed that people and organizations become better at their tasks as the tasks are repeated. The effect of this learning phenomenon on classical scheduling problems has been studied recently. One of the single-machine scheduling problems which seems to become nontrivial when learning effects are introduced is that of minimizing the number of tardy jobs. In this note, we study the special case where all jobs share a common due-date. We show that even when the learning process is assumed to be general and job-dependent, the problem remains polynomially solvable.

Original languageAmerican English
Pages (from-to)110-112
Number of pages3
JournalJournal of the Operational Research Society
Volume56
Issue number1
DOIs
StatePublished - Jan 2005

Bibliographical note

Funding Information:
Acknowledgements—This work was supported in part by the Recanati Fund of the School of Business, The Hebrew University, Jerusalem and by the National Science and Engineering Research Council (NSERC) of Canada Grant Number OGP0002507.

Keywords

  • Learning curves
  • Scheduling
  • Single-machine

Fingerprint

Dive into the research topics of 'Note on scheduling with general learning curves to minimize the number of tardy jobs'. Together they form a unique fingerprint.

Cite this