The shifting bottleneck procedure for job-shops with parallel machines

International Journal of Industrial and Systems Engineering

Volumn 1, Issue 1-2, 2006, Pages 244-262

  Chen, Kai Pei ^a   Lee, Marvin S ^a   Pulat, P Simin ^a   Moses, Scott A ^a  

^a University of Oklahoma   (United States)

Author keywords

heuristics; production; scheduling

Indexed keywords

EID: 64049101513     PISSN: 17485037     EISSN: 17485045     Source Type: Journal    
DOI: 10.1504/ijise.2006.009059     Document Type: Article

References (17)

1. Adams, J., Balas, E. and Zawack, D. (1988) ‘The shifting bottleneck procedure for job shop scheduling’, Management Science, Vol. 34, No. 3, pp.391–401.
2. Aytug, H., Kempf, K. and Uzsoy, R. (2002) ‘Measures of subproblems criticality in decomposition algorithm for job shop scheduling’, International Journal of Production Research, Vol. 41, No. 5, pp.865–882.
3. Balas, E. and Vazacopoulos, A. (1998) ‘Guided local search with shifting bottleneck for job shop scheduling’, Management Science, Vol. 44, No. 2, pp.262–275.
4. Dauzer-Peres, S. and Lasserre, J.B. (1993) ‘A modified shifting bottleneck procedure for job-shop scheduling’, International Journal of Production Research, Vol. 31, No. 4, pp.923–932.
5. Demirkol, E., Mehta, S. and Uzsoy, R. (1997) ‘A computational study of shifting bottleneck procedures for shop scheduling problems’, Journal of Heuristic, Vol. 3, pp.111–137.
6. Ivens, P. and Lambrecht, M. (1996) ‘Extending the shifting bottleneck procedure to real-life applications’, European Journal of Operational Research, Vol. 90, No. 2, pp.252–268.
7. Johnson, S.M. (1954) ‘Optimal two and three-stage production schedules with set-up times included’, Naval Research Logistics Quarterly, Vol. 1, pp.61–68.
8. Koulamas, C. (1998) ‘A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem’, Computers and Operations Research, Vol. 25, No. 2, pp.83–89.
9. Mason, S.J. and Oey, K. (2003) ‘Scheduling complex job shops using disjunctive graphs: a cycle elimination procedure’, International Journal of Production Research, Vol. 41, No. 5, pp.981–994.
10. Mason, S.J., Fowler, J.W. and Carlyle, W.M. (2002) ‘A modified shifting bottleneck heuristic for minimising total weighted tardiness in complex job shops’, Journal of Scheduling, Vol. 5, pp.247–262.
11. Matsuo, H., Suh, C.J. and Sullivan, R.S. (1988) A Controlled Search Simulated Annealing Approach for the General Job Shop Scheduling Problem, University of Texas at Austin, Texas.
12. Muth, J.F. and Thompson, G.L. (1963) Industrial Scheduling, Prentice-Hall, Englewood Cliffs, NJ.
13. Ovacik, I.M. and Uzsoy, R. (1997) Decomposition Methods for Complex Factory Scheduling Problems, Kluwer Academic Publishers, Noewell, MA.
14. Pinedo, M. (1995) Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ.
15. Singer, M. (2001) ‘Decomposition methods for large job shops’, Computers and Operations Research, Vol. 28, pp.193–207.
16. Taillard, E. (1994) ‘Parallel taboo search techniques for the job shop scheduling problem’, Journal of Computing, Vol. 6, pp.108–117.
17. Uzsoy, R. and Wang, C.S. (2000) ‘Performance of decomposition procedures for job shop scheduling problems with bottleneck machines’, International Journal of Production Research, Vol. 38, No. 6, pp.1271–1286.