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

G Mosheiov () and J B Sidney
Additional contact information
G Mosheiov: The Hebrew University
J B Sidney: The University of Ottawa

Journal of the Operational Research Society, 2005, vol. 56, issue 1, 110-112

Abstract: 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.

Keywords: scheduling; single-machine; learning curves (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601809 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:56:y:2005:i:1:d:10.1057_palgrave.jors.2601809

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601809

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().