Heuristics for permutation flow shop scheduling with batch setup times

OR Spectrum

Volumn 18, Issue 2, 1996, Pages 67-80

  Sotskov, Yuri N ^a   Tautenhahn, Thomas ^b   Werner, Frank ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Batch setup times; Flow shop scheduling; Group technology; Heuristics; Manufactoring cells

Indexed keywords

EID: 0002131672     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01539731     Document Type: Article

References (47)

1. Albers S, Brucker P (1993) The Complexity of One-Machine Batching Problems. Discr Appl Math 47:87-107
2. Allison JD (1990) Combining Petrov's Heuristic and the CDS Heuristic in Group Scheduling Problems. Comput Ind. Eng 19:457-461
3. Baker KR (1988) Scheduling the Production of Components at a Common Facility. IEE Transact 20:32-35
4. Bräsel H, Tautenhahn T, Werner F (1993) Constructive Heuristic Algorithms for the Open Shop Problem. Computing 51:95-110
5. Campbell HG, Dudek RA, Smith ML (1970) A Heuristic Algorithm for the n-Job, m-Machine Sequencing Problem. Manag Sci 16:630-637
6. Chen WH, Sristava B (1994) Simulated Annealing Procedures for Forming Machine Cells in Group Technology. Eur J Oper Res 75:100-111
7. Cleveland GA, Smith SF (1989) Using Genetic Algorithms to Schedule Flow Shop Releases, In: Schaeffer JD (ed) Proceedings of the third international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 160-169
8. Dannenbring DG (1977) An Evaluation of Flow Shop Sequencing Heuristics. Manag Sci 23:1273-1283
9. Dobson G, Kamarkar US, Rummel JL (1987) Batching to Minimize Flow Times on One Machine. Manag Sci 33:784-799
10. Domschke W, Forst P, Voss S (1992) Tabu Search Techniques for the Quadratic Semi-Assignment Problem. In: Fandel G, Gulledge T, Jones A (eds) New Directions for Operations Research in Manufacturing. Springer, Berlin, pp 389-405
11. Dudek RA, Panwalkar SS, Smith ML (1992) The Lessons of Flowshop Scheduling Research. Oper Res 40:7-13
12. Garey MR, Johnson DS, Sethi R (1976) The Complexity of Flowshop and Jobshop Scheduling. Math Oper Res 1:117-129
13. Glass CA, Potts CN (1994) A Comparison of Local Search Methods for Flow Shop Scheduling. Working Paper, University of Southampton
14. Glover F (1989) Tabu Search - Part I. ORSA J Comput 1:190-206
15. Glover F (1990) Tabu Search - Part II. ORSA J Comput 2:4-32
16. Grabowski J (1982) A New Algorithm of Solving the Flow Shop Problem, In: Feichtinger G, Kall P (eds) Operations Research in Progress. Reidel, Dordrecht, pp 57-75
17. Gupta JND (1988) Single Facility Scheduling with Multiple Job Classes. Eur J Oper Res 33:42-45
18. Hitomi K, Ham I (1976) Operations Scheduling for Group Technology. CIRP Annals 25:419-422
19. Ho JC, Chang YL (1991) A New Heuristic for the n-Job, m-Machine Flow-Shop Problem. Eur J Oper Res 52:194-202
20. Ignall E, Schrage L (1965) Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems. Oper Res 13:400-412
21. Johnson SM (1954) Optimal Two- and Three-Stage Production Scheduling with Setup Times Included. Naval Res Logist Quart 1:61-68
22. Kleinau U (1993) Two-Machine Shop Scheduling Problems with Batch Processing. Math Comput Modelling 17:55-63
23. Kuik R, Salomon M, van Wassenhove L (1994) Batching Decisions: Structure and Models. Eur J Oper Res 75:243-263
24. Kusiak A, Chow WS (1988) Decomposition of Manufacturing Systems. IEEE J Robotics and Automation 4/5:457-471
25. van Laarhoven PJM, Aarts EHL (1987) Simulated Annealing: Theory and Applications. Reidel, Dordrecht
26. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of Machine Scheduling Problems. Ann Discr Math 1:343-362
27. MacCarthy BL, Liu J (1993) Addressing the Gap in Scheduling Research: A Review of Optimization and Heuristic Methods in Production Research. Int J Prod Res 31:59-79
28. Monma CL, Potts CN (1989) On the Complexity of Scheduling with Batch Setup Times. Oper Res 37:788-803
29. Naddef D, Santos C (1988) One-Pass Batching Algorithms for the One-Machine Problem. Discr Appl Math 21:133-145
30. Nawaz M, Enscore EE, Ham I (1983) A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem. OMEGA 11:91-95
31. Osman IH, Potts CN (1989) Simulated Annealing for Permutation Flow-Shop Scheduling. OMEGA 17:551-557
32. Ow PS, Morton TE (1989) The Single Machine Early/Tardy Problem. Manag Sci 35:177-191
33. Pinto PA, Rao BM (1992) Joint Lot-Sizing and Scheduling for Multi-Stage Multi-Product Flow Shops. Int J Prod Res 30:1137-1152
34. Reeves CR (1993) Improving the Efficiency of Tabu Search for Machine Sequencing Problems. J Oper Res Soc 44:375-382
35. Santos C, Magazine M (1985) Batching in Single Operation Manufacturing Systems. Oper Res Lett 4:99-103
36. Shanthikumar JG, Wu YB (1985) Decomposition Approaches in Permutation Scheduling Problems with Applications to the m-Machine Flow Shop Scheduling Problem. Eur J Oper Res 19:125-141
37. Simons JV (1992) Heuristics in Flow Shop Scheduling with Sequence Dependent Setup Times. Omega 20:215-225
38. max Flowshop Problem. In: Fandel G, Gulledge T, Jones A (eds) New directions for Operations Research in Manufacturing. Springer, Berlin, pp 149-160
39. Taillard E (1990) Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem. Eur J Oper Res 47:65-74
40. Taillard E (1993) Benchmarks for Basic Scheduling Problems. Eur J Oper Res 64:278-285
41. Vakharia AJ, Chang Y-L (1990) A Simulated Annealing Approach to Scheduling a Manufacturing Cell. Naval Res Log Quart 37:559-577
42. van de Velde SL (1990) Minimizing the Sum of the Job Completion Times in the Two-Machine Flow Shop by Lagrangean Relaxation. Ann Oper Res 26:257-268
43. van Wassenhove L, Potts CN (1992) Integrating Scheduling with Batching and Lot Sizing: A Review of Algorithms and Complexity. J Oper Res Soc 43:395-406
44. Werner F (1988) Ein adaptives stochastisches Suchverfahren für spezielle Reihenfolgeprobleme. Ekonomicko-Matematicky Obzor 24:50-67
45. Werner F (1993) On the Heuristic Solution of the Permutation Flow Shop Problem by Path Algorithms. Comput Oper Res 20:707-722
46. Werner F, Winkler A (1995) Insertion Techniques for the Heuristic Solution of the Job Shop Problem. Discr Appl Math 58:191-211
47. Widmer M, Hertz A (1989) A New Heuristic Method for the Flow Shop Sequencing Problem. Eur J Oper Res 41:186-193