A shifting bottleneck approach for a parallel-machine flowshop scheduling problem

Journal of the Operations Research Society of Japan

Volumn 44, Issue 2, 2001, Pages 140-156

  Cheng, Jinliang ^a   Karuno, Yoshiyuki ^a   Kise, Hiroshi ^a  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346485830     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0453-4514(01)90003-1     Document Type: Article

References (32)

1. J. Adams, E. Balas and D. Zawaku: The shifting bottleneck procedure for job shop scheduling. Management Science, 34 (1988) 391-401.
2. E. H. Aghezzaf and A. Artiba: Aggregate planning in hybrid flowshops. International Journal of Production Research, 36 (1998) 2463-2477.
3. T. S. Arthanary and K. G. Ramaswarmy: An extension of two machine sequencing problem. Opsearch, 8 (1971) 10-22.
4. S. A. Brah and J. L. Hunsucker: Branch-and-bound algorithm for the flowshop with multiple processors. European Journal of Operational Research, 51 (1991) 88-99.
5. S. A. Brah and L. L. Loo: Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research, 113 (1999) 113-122.
6. J. Carlier: One machine sequencing problem. European Journal of Operational Research, 11 (1982) 42-47.
7. J. Carlier: Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research, 29 (1987) 298-306.
8. B. Chen: Analysis of classes of heuristics for scheduling a two-stage flowshop with parallel machines at one stage. Operations Research, 46 (1995) 234-244.
9. D. Deal and J. Hunsucker: The two-stage flow-shop problem with m machines at each stage. Journal of Information and Optimization Science, 12 (1991) 407-417.
10. A. Guinet and M. Solomon: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. International Journal of Production Research, 34 (1996) 1643-1654.
11. J. N. D. Gupta: Two-stage hybrid flow shop scheduling problem. Operations Research, 39 (1988) 359-364.
12. J. N. D. Gupta, A. M. A. Hariri and C. N. Potts: Scheduling a two-stage hybrid flowshop with parallel-machine at the first stage. Annals of Operations Research, 69 (1997) 171-191.
13. J. N. D. Gupta and E. Tunc: Scheduling for a two-stage hybrid flowshop with parallel-machine at the second stage. International Journal of Production Research, 29 (1991) 1489-1502.
14. J. A. Hoogeveen, J. A. Lenstra and J. K. Veltman: Minimizing makespan in a multi-processor flowshop is strongly NP-hard. European Journal of Operational Research, 89 (1993) 172-175.
15. J. Hunsucker and J. Shah: Performance of priority rules in a due date flow shop. OMEGA, 20 (1992) 73-89.
16. H. Iima and N. Sannomiya: Genetic algorithm for a scheduling problem in an electric wire production system with three subprocesses. Proceedings of 1999 IFAC 14th Triennial World Congress, Beijing, P.R. China, (1999) 279-284.
17. H. Kise, T. Ibaraki and H. Mine: Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society of Japan, 22 (1979) 205-224.
18. S. Kochhar and R. J. T. Morris: Heuristic methods for flexible flow line scheduling. Journal of Manufacturing Systems, 6 (1987) 299-314.
19. C. Lee and G. Vairaktarakis: Minimizing makespan in hybrid flow-shops. Operations Research Letters, 16 (1994) 149-151.
20. J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker: Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1 (1977) 343-362.
21. V. J. Leon and B. Ramamoothy: An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions, 29 (1997) 115-125.
22. H. Luss and M. Rosenwein: A due date assignment algorithm for multiproduct manufacturing facilities. European Journal of Operational Research, 65 (1993) 187-198.
23. R. J. Paul: A production scheduling problem in the glass-container industriy. Operations Research, 22 (1979) 290-312.
24. C. Rajendran and D. Chaudhuri: A multi-stage parallel-processor flowshop problem with minimum flow time. European Journal of Operational Research, 57 (1992) 111-122.
25. C. Rajendran and D. Chaudhuri: Scheduling in n-job, m-stage flow-shop with parallel-processor to minimize makespan. International Journal of Production Research, 27 (1992) 137-143.
26. F. Riane, A. Artiba and S. E. Elmaghraby: A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. European Journal of Operational Research, 109 (1998) 321-329.
27. A. Rumudhin and P. Marier: The generalized shifting bottleneck procedure. European Journal of Operational Research, 93 (1996) 34-48.
28. D. L. Santos, J. L. Hunssucker and D. E. Deal: Global lower bounds for flowshops with multiple processors. European Journal of Operational Research, 80 (1995) 112-120.
29. L. Seetharama: Scheduling in a two-stage manufacturing process. International Journal of Production Research, 22 (1984) 555-564.
30. C. Sriskandarajah and S. P. Sethi: Scheduling algorithms for flexible flow shops: worst and average case performance. European Journal of Operational Research, 43 (1989) 143-160.
31. R. Wittrock: Scheduling algorithms for flexible flow line. IBM Journal of Research and Development, 29 (1985) 401-412.
32. R. Wittrock: An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36 (1988) 445-453.