Late work minimization in flow shops by a genetic algorithm

Computers and Industrial Engineering

Volumn 57, Issue 4, 2009, Pages 1202-1209

  Pesch, Erwin ^a   Sterna, Malgorzata ^b  

^a UNIVERSITY OF SIEGEN   (Germany)

^b POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Genetic algorithm; Late work criterion; Meta heuristic search; Shop scheduling

Indexed keywords

COMPUTATIONAL EXPERIMENT; DUE DATES; FLOW-SHOPS; LATE WORK; LATE WORK CRITERIA; LIST-SCHEDULING; META HEURISTIC ALGORITHM; META-HEURISTIC SEARCH; NP-HARD; PERMUTATION FLOW-SHOP SCHEDULING; PRIORITY DISPATCHING RULES; RELEASE TIME; SHOP SCHEDULING; SOLUTION REPRESENTATION;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; EXPERIMENTS; GENETIC ALGORITHMS; HEURISTIC METHODS; MACHINE SHOP PRACTICE; MODULAR ROBOTS;

HEURISTIC ALGORITHMS;

EID: 71849108519     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.05.011     Document Type: Article

References (36)

1. Blazewicz J. Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques 3 6 (1984) 415-420
2. Blazewicz J., Ecker K., Pesch E., Schmidt G., and Weglarz J. Handbook on scheduling. From theory to applications (2007), Springer, Berlin, Heidelberg, New York
3. Blazewicz J., and Finke G. Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters 24 (1987) 259-263
4. Blazewicz J., Pesch E., Sterna M., and Werner F. Open shop scheduling problems with late work criteria. Discrete Applied Mathematics 134 (2004) 1-24
5. Blazewicz J., Pesch E., Sterna M., and Werner F. The two-machine flow-shop problem with weighted late work criterion and common due date. European Journal of Operational Research 165 2 (2005) 408-415
6. Blazewicz J., Pesch E., Sterna M., and Werner F. A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Computers and Industrial Engineering 49 (2005) 611-624
7. Blazewicz J., Pesch E., Sterna M., and Werner F. A note on two-machine job shop with weighted late work criterion. Journal of Scheduling 10 2 (2007) 87-95
8. Blazewicz J., Pesch E., Sterna M., and Werner F. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Computers and Operations Research 35 2 (2008) 574-599
9. Crama Y., Kolen A., and Pesch E. Local search in combinatorial optimization. Lecture Notes in Computer Science 931 (1995) 157-174
10. Demirkol E., Mehta S., and Uzsoy R. Benchmarks for shop problems. European Journal of Operational Research 109 (1998) 137-141
11. Dorndorf U., and Pesch E. Evolution based learning in a job shop scheduling environment. Computers and Operations Research 22 (1995) 25-40
12. Goldberg D.E. Genetic algorithms in search, optimization and machine learning (1989), Addison-Wesley, Reading
13. Hariri A.M.A., Potts C.N., and Van Wassenhove L.N. Single machine scheduling to minimize total late work. INFORMS Journal on Computing 7 (1995) 232-242
14. Haupt R. A survey of priority rule-based scheduling. OR Spektrum 11 (1989) 3-16
15. Hochbaum D.S., and Shamir R. Minimizing the number of tardy job units under release time constraints. Discrete Applied Mathematics 28 (1990) 45-57
16. Hochbaum D.S., and Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research 39 4 (1991) 648-653
17. Holland, J. H. (1975). Adaptation in natural and artificial systems. Technical report. Ann Harbor: University of Michigan.
18. Kethley R.B., and Alidaee B. Single machine scheduling to minimize total late work: A comparison of scheduling rules and search algorithms. Computers and Industrial Engineering 43 (2002) 509-528
19. Kolen A., and Pesch E. Genetic local search in combinatorial optimization. Discrete Applied Mathematics 48 (1994) 273-284
20. Kovalyov M.Y., Potts C.N., and Van Wassenhove L.N. A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research 19 1 (1994) 86-93
21. Leung J.Y.-T. Minimizing total weighted error for imprecise computation tasks and related problems. In: Leung J.Y.-T. (Ed). Handbook of scheduling: Algorithms, models, and performance analysis (2004), CRC Press, Boca Raton 34-1-34-16
22. Lin B.M.T., Lin F.C., and Lee R.C.T. Two-machine flow-shop scheduling to minimize total late work. Engineering Optimization 38 4 (2006) 501-509
23. McGill J.I., and van Ryzin G.J. Revenue management. Research overview and prospects. Transportation Science 33 (1999) 233-256
24. Pinedo M. Scheduling: Theory, algorithms and systems (1995), Prentice Hall, New Jersey
25. Potts C.N., and Van Wassenhove L.N. Single machine scheduling to minimize total late work. Operations Research 40 3 (1991) 586-595
26. Potts C.N., and Van Wassenhove L.N. Approximation algorithms for scheduling a single machine to minimize total late work. Operations Research Letters 11 (1991) 261-266
27. Reza Hejazi S., and Saghafian S. Flowshop-scheduling problems with makespan criterion: A review. International Journal of Production Research 43 14 (2005) 2895-2929
28. Ross P. Hyper-heuristics. In: Burke E.K., and Kendall G. (Eds). Search methodologies: Introductory tutorials in optimization and decision support methodologies (2005), Springer, New York 529-556
29. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 (2005) 479-494
30. Sastry K., Goldberg D., and Kendall G. Genetic algorithms. In: Burke E.K., and Kendall G. (Eds). Search methodologies: Introductory tutorials in optimization and decision support methodologies (2005), Springer, New York 97-126
31. Sterna, M. (2000). Problems and algorithms in non-classical shop scheduling. Ph.D. Thesis. Poznan: Scientific Publishers of the Polish Academy of Sciences.
32. Sterna, M. (2006). Late work scheduling in shop systems. Dissertations 405. Poznan: Scientific Publishers of the Polish Academy of Sciences.
33. Sterna M. Late work minimization in a small flexible manufacturing system. Computers and Industrial Engineering 52 2 (2007) 210-228
34. Sterna M. Dominance relations for two-machine flow-shop problem with late work criterion. Bulletin of the Polish Academy of Sciences 55 1 (2007) 59-69
35. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
36. Vallada E., Ruiz R., and Minella G. Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers and Operations Research 35 (2008) 1350-1373