Single Machine Scheduling with Learning Effect Considerations
T.C. Cheng () and
Guoqing Wang ()
Annals of Operations Research, 2000, vol. 98, issue 1, 273-290
In this paper we study a single machine scheduling problem in which the job processing times will decrease as a result of learning. A volume-dependent piecewise linear processing time function is used to model the learning effects. The objective is to minimize the maximum lateness. We first show that the problem is NP-hard in the strong sense and then identify two special cases which are polynomially solvable. We also propose two heuristics and analyse their worst-case performance. Copyright Kluwer Academic Publishers 2000
Keywords: scheduling; sequencing; learning (search for similar items in EconPapers)
References: Add references at CitEc
Citations: View citations in EconPapers (29) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:98:y:2000:i:1:p:273-290:10.1023/a:1019216726076
Ordering information: This journal article can be ordered from
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla ().