Complexity results for single-machine scheduling with positional learning effects

Journal of the Operational Research Society

Volumn 58, Issue 8, 2007, Pages 1099-1102

  Lin, B M T ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Late job; Learning effect; NP hardness; Single machine scheduling

Indexed keywords

ALGORITHMS; JOB ANALYSIS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

LATE JOB; LEARNING EFFECTS; NP-HARDNESS; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 34547242463     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602227     Document Type: Article

References (4)

1. Alidaee B and Womer NK (1999). Scheduling with time dependent processing times: Review and extensions. J Opl Res Soc 50: 711-720.
2. 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.
3. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freedman: San Francisco, CA.
4. Mosheiov Q 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.