Erratum to: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines [Appl. Math. Comput. 184 (2007) 945-949] (DOI:10.1016/j.amc.2006.05.206);A note on flow shop scheduling problems with a learning effect on no-idle dominant machines

Applied Mathematics and Computation

Volumn 184, Issue 2, 2007, Pages 945-949

  Cheng, MingBao ^a   Sun, ShiJie ^b   Yu, Ying ^b  

^a JINAN UNIVERSITY   (China)

^b SHANGHAI UNIVERSITY   (China)

Author keywords

Algorithm; Learning effect; Permutation flow shop; Scheduling

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

DOMINANT MACHINES CONSTRAINT; LEARNING EFFECTS; PERMUTATION FLOW SHOP; POLYNOMIAL-TIME SOLUTION ALGORITHM;

SCHEDULING;

EID: 33846617917     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.10.049     Document Type: Erratum

References (14)

1. Biskup D. Single-machine scheduling with learning consideration. European Journal of Operational Research 115 (1999) 173-178
2. Mosheiov G. Scheduling problems with a learning effect. European Journal of Operational Research 132 (2001) 687-693
3. Mosheiov G., and Sidney J.B. Scheduling with general job-dependent learning curve. European Journal of Operational Research 147 (2003) 665-670
4. Bachman J., and Janiak A. Scheduling jobs with position-dependent processing time. Journal of the Operational Research Society 55 (2004) 254-257
5. Gonzalez T., and Sahni S. Flow shop and job-shop schedules: complexity and approximation. Operations Research 26 (1978) 36-52
6. Smutnicki C. Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research 109 (1998) 66-87
7. Nouweland A.V.D., Krabbenborg M., and Potters J. Flow shop with a dominant machine. European Journal of Operational Research 62 (1992) 38-46
8. Ho J.C., and Gupta J.N.D. Flow shop scheduling with dominant machines. Computers and Operations Research 22 (1995) 237-246
9. Xiang S., Tang G., and Cheng T.C.E. Solvable cases of permutation flow shop scheduling with dominating machines. International Journal Production Economics 66 (2000) 53-57
10. Čepek O., Okada M., and Vlach M. Non-preemptive flow shop scheduling with machine dominance. European Journal of Operational Research 139 (2002) 245-261
11. Wang J.-B., and Xia Z.-Q. Flow shop scheduling with a learning effect. Journal of the Operational Research Society 56 (2005) 1325-1330
12. Lee W.-C., and Wu C.-C. Minimizing total completion time in a two-machine flow-shop with a learning effect. International Journal Production Economics 88 (2004) 85-93
13. Wu C.-C. A makespan study of the two-machine flow-shop scheduling problem with a learning effect. Journal of Statistics and Management Systems 8 (2005) 13-25
14. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326