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

Journal of the Operational Research Society

Volumn 56, Issue 1, 2005, Pages 110-112

  Mosheiov, G ^a,c   Sidney, J B ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF OTTAWA   (Canada)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Learning curves; Scheduling; Single machine

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; LEARNING SYSTEMS; OPERATIONS RESEARCH; POLYNOMIALS; PROBLEM SOLVING; SOCIETIES AND INSTITUTIONS;

JOB PROCESSING; LEARNING CURVES; PROCESSING TIME; SINGLE-MACHINE;

SCHEDULING;

EID: 12144249183     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601809     Document Type: Article

References (8)

1. Heizer J and Render B (1999). Operations Management, 5th edn. Prentice-Hall: Englewood Cliffs, NJ.
2. Badiru AB (1992). Computational survey of univariate and multivariate learning curve models. IEEE Trans Eng Mngt 39: 176-188.
3. Wright TP (1936). Factors affecting the cost of airplanes. J Aeronaut Sci 3: 122-128.
4. Biskup D (1999). Single-machine scheduling with learning considerations. Eur J Opl Res 115: 173-178.
5. Mosheiov G (2001). Scheduling problems with a learning effect. Eur J Opl Res 132: 687-693.
6. Mosheiov G (2001). Multi-machine scheduling with learning effect. J Opl Res Soc 52: 1165-1169.
7. Mosheiov G and Sidney JB (2003). Scheduling with general job-dependent learning curves. Eur J Opl Res 147: 665-670.
8. Moore JM (1968). An n job, one machine sequencing algorithm for minimizing the number of tardy jobs. Mngt Sci 15: 102-109.