Metaheuristics for late work minimization in two-machine flow shop with common due date

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3698 LNAI, Issue , 2005, Pages 222-234

  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

[No Author keywords available]

Indexed keywords

ALGORITHMS; MACHINE SHOPS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

METAHEURISTICS; SCHEDULING ALGORITHM; THREE TRAJECTORY BASED METHODS; TWO-MACHINE FLOW SHOP PROBLEM;

HEURISTIC METHODS;

EID: 33646169582     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11551263_19     Document Type: Conference Paper

References (25)

1. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart JR., W.R.: Designing and Reporting on Computational Experiments with Heuristic Methods. Journal of Heuristics 1 (1995) 9-32
2. Blazewicz, J.: Scheduling Preemptible Tasks on Parallel Processors with Information Loss. Recherche Technique et Science Informatiques 3/6 (1984) 415-420
3. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. 2nd edn. Springer-Verlag, Berlin Heidelberg New York (2001)
4. Blazewicz, J., Finke, G.: Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Information Processing Letters 24 (1987) 259-263
5. Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Revenue Management in a Job-shop: a Dynamic Programming Approach. Preprint Nr. 40/03. Otto-von-Guericke-University, Magdeburg (2003)
6. Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Open Shop Scheduling Problems with Late Work Criteria. Discrete Applied Mathematics 134 (2004) 1-24
7. Blazewicz, J., Pesch, E., Sterna, M., 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
8. Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy. Lecture Notes in Computer Science 3285 (2004) 68-75
9. Blum, Ch., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35/3 (2003) 268-308
10. Brucker, P.: Scheduling Algorithms. 2nd edn. Springer-Verlag, Berlin Heidelberg New York (1998)
11. Crama, Y., Kolen, A., Pesch, E.: Local Search in Combinatorial Optimization. Lecture Notes in Computer Science 931 (1995) 157-174
12. th International Workshop on Project Management and Scheduling (1994) 232-235
13. Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., San Francisco (1979)
14. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)
15. Hansen, P., Mladenović, N.: Variable Neighbour Search. Principles and Applications. European Journal of Operational Research 130 (2001) 449-467
16. Haupt, R.: A Survey of Priority Rule-Based Scheduling. OR Spektrum 11 (1989) 3-16
17. Hooker, J.N.: Testing Heuristics: We Have It All Wrong. Journal of Heuristics 1 (1995) 33-42
18. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220/4598 (1983) 671-680
19. Johnson, S.M.: Optimal Two- and Three-Stage Production Schedules. Naval Research Logistics Quarterly 1 (1954) 61-68
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. CRC Press, Boca Raton (2004) Chapter 34, 1-16
21. Pesch, E., Glover, F.: TSP Ejection Chains. Discrete Applied Mathematics 76 (1997) 165-181
22. Pinedo, M., Chao, X.: Operation Scheduling with Applications in Manufacturing and Services. Irwin/McGraw-Hill, Boston (1999)
23. Potts, C.N., Van Wassenhove, L.N.: Single Machine Scheduling to Minimize Total Late Work. Operations Research 40/3 (1991) 586-595
24. Potts, C.N., Van Wassenhove, L.N.: Approximation Algorithms for Scheduling a Single Machine to Minimize Total Late Work. Operations Research Letters 11 (1991) 261-266
25. Sterna, M.: Problems and Algorithms in Non-Classical Shop Scheduling. Scientific Publishers of the Polish Academy of Sciences, Poznan (2000)