Performance of decomposition procedures for job shop scheduling problems with bottleneck machines

International Journal of Production Research

Volumn 38, Issue 6, 2000, Pages 1271-1286

  Uzsoy, Reha ^a   Wang, Cheng Shuo ^a  

^a SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MANUFACTURE; OPTIMAL SYSTEMS;

JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0034655062     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075400188843     Document Type: Article

References (39)

1. Aarts, E. H. L., Van Laarhoven, P. J. M., Lenstra, J. K. and Ulder, N. L. J., 1994, A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing, 6, 118-125.
2. Adams, J., Balas, E. and ZAwack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science 3, 391-401.
3. Applegate, D. and Cook, W., 1991, A computational study of job shop scheduling. ORSA Journal of Computing, 3, 149-156.
4. Balas, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration approach. Operations Research, 17, 941-957.
5. Balas, E., Lenstra, J. K. and Vazacopoulos, A., 1995, The one machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science, 41, 94-109.
6. Balas, E. and Vazacopoulos, A., 1998, Guided local search with shifting bottleneck for job shop scheduling. Management Science, 44, 262-275.
7. BHAskaran, K. and Pinedo, E., 1991, Dispatching. In G. Salvendy (ed.), Handbook of Industrial Engineering (New York: Wiley) chapter 83.
8. Biazewtcz, J., Domschke, W. and Pesch, E., 1996, The job shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research, 93, 1-33.
9. Brucker, P., Jurisch, B. and Sievers, B., 1994, A branch and bound algorithm for the job shop scheduling problem. Discrete Applied Mathematics, 49, 102-127.
10. Carlier, J., 1982, The one machine sequencing problem. European Journal of Operational Research, 11, 42-47.
11. Carlier, J. and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35, 164-176.
12. Dauzere-Peres, S. and Lasserre, J. B., 1993, A modified shifting bottleneck procedure for job shop scheduling. International Journal of Production Research, 31, 923-932.
13. Demirkol, E., Mehta, S. V. and Uzsoy, R., 1997, A computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3, 111-137.
14. Demirkol, E. and Uzsoy, R., 1998a, Neighborhood search for job shop problems with sequence-dependent setups. Research Report, School of Industrial Engineering, Purdue University.
15. Demirkol, E. and Uzsoy, R., 1998b, Decomposition methods for scheduling re-entrant flow shops with sequence dependent setup times. Research Report, School of Industrial Engineering, Purdue University.
16. Fox, M. S. and Smith, S. F., 1984, ISIS—a knowledge-based system for factory scheduling. Expert Systems, 1, 25-49.
17. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability: A Guide to Theory of NP Completeness (San Francisco: W. H. Freeman).
18. Goldratt, E. M. and Cox, J., 1986, The Goal: A Process of Ongoing Improvement (New York: North River Press).
19. Goldratt, E. M. and Fox, R. E., 1986, The Race (Croton-on-Hudson, NY: North River Press).
20. Holtsclaw, H. H. and Uzsoy, R., 1996, Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: a computational study. Journal of the Operational Research Society, 47 666-677.
21. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., 1993, Sequencing and scheduling: algorithms and complexity. in S. C. Graves, A. H. G. Rinnooy Kan and P. Zipkin (eds.), Handbooks in Operations Research and Management Science. Vol. 4: Logistics of Production and Inventory (Amsterdam: North-Holland).
22. Matsuo, H., Suh, C. J. and Sullivan, R. S., 1988, A controlled search simulated annealing approach for the general job shop scheduling problem. Working Paper 03-04-88, Department of Management, Graduate School of Business, University of Texas at Austin.
23. Nowicki, E. and Smutnicki, C., 1996, A fast taboo search algorithm for the job shop problem. Management Science, 42, 797-813.
24. Ovacik, I. M. and Uzsoy, R., 1997, Decomposition Methods for Complex Factory Scheduling Problems (Norwell, MA: Kluwer Academic).
25. Panwalkar, S. S. and Iskander, W., 1977, A survey of scheduling rules. Operations Research, 25, 45-61.
26. Pinedo, M., 1995, Scheduling: Theory, Algorithms, and Systems (Englewood Cliffs, NJ: Prentice Hall).
27. Pinedo, M. and Singer, M., 1996, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Research Report, Department of Industrial Engineering and Operations Research, Columbia University.
28. Roy, B. and Sussmann, B., 1964, Les Problems d’Ordonnancement avec des Contraintes Disjonctives, Note DS No. 9 bis, SEMA, Montrouge.
29. Sadeh, N., 1991, Look-ahead techniques for micro-opportunistic job shop scheduling. PhD thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.
30. Simons, J. V. and Simpson, W. P., 1997, An exposition of multiple constraint scheduling as implemented in the goal system (formerly DISASTER). Production and Operations Management, 6, 3-22.
31. Simons, J. V., Simpson, W. P., Carlson, B. J., James, S. W., Lettiere, C. A. and Mediate, B. A., 1996, Formulation and solution of the drum-buffer-rope constraint scheduling problem. International Journal of Production Research, 34, 2405-2420.
32. Spearman, M. L., 1997, On the theory of constraints and the goal system. Production and Operations Management, 6, 28-33.
33. Storer, R. H., Wu, S. D. and Vaccari, R., 1992, New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38, 1495-1509.
34. Taillard, E. D., 1994, Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6, 108-117.
35. Uzsoy, R., Lee, C. Y. and Martin-Vega, L. A., 1992, A review of production planning and scheduling models in the semiconductor industry. Part I: system characteristics, performance evaluation and production planning. IIE Transactions on Scheduling and Logistics, 24, 47-59.
36. Uzsoy, R., Lee, C. Y. and Martin-Vega, L. A., 1994, A survey of production planning and scheduling models in the semiconductor industry. Part II: shop-floor control. IIE Transactions on Scheduling and Logistics, 26, 44-55.
37. Vaessens, R. J. M., Aarts, E. H. L. and Lenstra, J. K., 1996, Job shop scheduling by local search. INFORMS Journal on Computing, 8, 302-317.
38. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
39. Yoo, W. S. and Martin-Vega, L. A., 1996, A decomposition methodology for scheduling semiconductor testing operation for number of tardy job measures. Research Report, Department of Computer Science, Utah State University.