Mosheiov, G.; Sidney, J. B. Note on scheduling with general learning curves to minimize the number of tardy jobs. (English) Zbl 1122.90356 J. Oper. Res. Soc. 56, No. 1, 110-112 (2005). Summary: 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. Cited in 34 Documents MSC: 90B35 Deterministic scheduling theory in operations research Keywords:scheduling; single-machine; learning curves PDFBibTeX XMLCite \textit{G. Mosheiov} and \textit{J. B. Sidney}, J. Oper. Res. Soc. 56, No. 1, 110--112 (2005; Zbl 1122.90356) Full Text: DOI