Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date

Computers and Operations Research

Volumn 35, Issue 2, 2008, Pages 574-599

  Blazewicz, Jacek ^a   Pesch, Erwin ^b   Sterna, Malgorzata ^a   Werner, Frank ^c  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF SIEGEN   (Germany)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Flow shop; Late work criteria; Metaheuristic; Scheduling; Simulated annealing; Tabu search; Variable neighborhood search

Indexed keywords

HEURISTIC METHODS; METADATA; SCHEDULING ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH;

LATE WORK CRITERIA; TWO-MACHINE FLOW-SHOP; VARIABLE NEIGHBORHOOD SEARCH; WORK PERFORMANCE MEASURE;

SUPPLY CHAIN MANAGEMENT;

EID: 34447108027     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.03.021     Document Type: Article

References (31)

1. Blazewicz J., Ecker K., Pesch E., Schmidt G., and Weglarz J. Scheduling computer and manufacturing processes. 2nd ed. (2001), Springer, Berlin, Heidelberg, New York
2. Brucker P. Scheduling algorithms. 2nd ed. (1998), Springer, Berlin, Heidelberg, New York
3. Chen B., Potts C.N., and Woeginger G.J. A review of machine scheduling. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization (1998), Kluwer Academic Publishers, Boston
4. Pinedo M., and Chao X. Operation scheduling with applications in manufacturing and services (1999), Irwin/McGraw-Hill, Boston
5. Blazewicz J. Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques 3 6 (1984) 415-420
6. Blazewicz J., and Finke G. Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters 24 (1987) 259-263
7. 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
8. Hochbaum D.S., and Shamir R. Minimizing the number of tardy job unit under release time constraints. Discrete Applied Mathematics 28 (1990) 45-57
9. 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
10. 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
11. Leung J.Y.-T., Yu V.K.M., and Wei W.-D. Minimizing the weighted number of tardy task units. Discrete Applied Mathematics 51 (1994) 307-316
12. Potts C.N., and Van Wassenhove L.N. Single machine scheduling to minimize total late work. Operations Research 40 3 (1991) 586-595
13. 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
14. Blazewicz J., Pesch E., Sterna M., and Werner F. Total late work criteria for shop scheduling problems. In: Inderfurth K., Schwoediauer G., Domschke W., Juhnke F., Kleinschmidt P., and Waescher G. (Eds). Operations Research Proceedings 1999 (2000), Springer, Berlin 354-359
15. Blazewicz J, Pesch E, Sterna M, Werner F. Revenue management in a job-shop: a dynamic programming approach. Preprint Nr. 40/03, FMA, Otto-von-Guericke-University Magdeburg; 2003.
16. Blazewicz J., Pesch E., Sterna M., and Werner F. Open shop scheduling problems with late work criteria. Discrete Applied Mathematics 134 (2004) 1-24
17. 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
18. 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 4 (2005) 611-624
19. Blazewicz J, Pesch E, Sterna M, Werner F. Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Preprint Nr. 32, FMA, Otto-von-Guericke-University Magdeburg; 2005.
20. 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, FL 1-16
21. Sterna M. Problems and algorithms in non-classical shop scheduling (2000), Scientific Publishers of the Polish Academy of Sciences, Poland, Poznan
22. Garey M.R., and Johnson D.S. Computers and intractability (1979), W.H. Freeman and Co., San Francisco
23. Blum Ch., and Roli A. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys 35 3 (2003) 268-308
24. Crama Y., Kolen A., and Pesch E. Local search in combinatorial optimization. Lecture Notes in Computer Science 931 (1995) 157-174
25. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
26. Haupt R. A survey of priority rule-based scheduling. OR Sektrum 11 (1989) 3-16
27. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 4598 (1983) 671-680
28. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Boston
29. Hansen P., and Mladenović N. An introduction to variable neighbour search. In: Voss S., Martello S., Osman I., and Roucairol C. (Eds). Metaheuristics: advances and trends in local search paradigms for optimization (1999), Kluwer Academic Publishers, Boston 433-458
30. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., and Stewart Jr. W.R. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1 (1995) 9-32
31. Hooker J.N. Testing heuristics: we have it all wrong. Journal of Heuristics 1 (1995) 33-42