Erratum: Scheduling jobs with position-dependent processing times (Journal of the Operational Research Society (2004) 55 (257-264) DOI: 10.1057/palgrave.jors.2601689);Scheduling jobs with position-dependentprocessing times

Journal of the Operational Research Society

Volumn 55, Issue 3, 2004, Pages 257-264

  Bachman, A ^a   Janiak, A ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Computational analysis; Learning effect; Position dependent processing time; Sequencing; Single machine; Worst case analysis; learning effect; single machine; computational complexity; sequencing

Indexed keywords

COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; OPTIMIZATION; PERSONNEL TRAINING; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

COMPUTATIONAL ANALYSIS; LEARNING EFFECTS; POSITION DEPENDENT PROCESSING TIME; SEQUENCING; SINGLE MACHINE; WORST CASE ANALYSIS;

OPERATIONS RESEARCH;

EID: 2342451996     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2012.18     Document Type: Erratum

References (7)

1. Mosheiov G (2001). Parallel machine scheduling with a learning effect. J Opl Res Soc 52: 1165-1169.
2. Biskup D (1999). Single-machine scheduling with learning considerations. Eur J Opl Res 115: 173-178.
3. Cheng TCE and Wang G (2000). Single machine scheduling with learning effect considerations. Am Opns Res 98: 273-290.
4. Mosheiov G (2001). Scheduling problems with a learning effect. Eur J Opl Res 132: 687-693.
5. Papadimitrou CH and Steiglitz K (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall: Englewood Cliffs, NJ.
6. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 3: 287-326.
7. Garey M.R. and Johnson D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman: San Francisco.