Measures of subproblem criticality in decomposition algorithms for shop scheduling

International Journal of Production Research

Volumn 41, Issue 5, 2003, Pages 865-882

  Aytug, H ^a   Kempf, K ^b   Uzsoy, R ^c  

^a UNIVERSITY OF FLORIDA   (United States)

^b INTEL CORPORATION   (United States)

^c SCHOOL OF INDUSTRIAL ENGINEERING   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SCHEDULING;

DECOMPOSITION ALGORITHMS;

PRODUCTION ENGINEERING;

EID: 0242269826     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/0020754021000037856     Document Type: Article

References (35)

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, 34, 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. Operation Research, 17, 941-957.
5. BALAS, E., LENSTRA, J. K. and VAZACOPOULOS, A., 1995, The one machine scheduling with delayed precedence constraints. 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, M., 1991, Dispatching. In G. Salvendy (ed.), Handbook of Industrial Engineering (New York: Wiley).
8. 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.
9. CARLIER, J., 1982, The one machine scheduling problem. European Journal of Operational Research, 11, 42-47.
10. CARLIER, J. and PINSON, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35, 164-176.
11. CHEN, C. C. and YIH, Y., 1996, Identifying attributes for knowledge-based development in dynamic scheduling environments. International Journal of Production Research, 34, 1739-1755.
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, Computational study of shifting bottleneck procedures for shop scheduling problems. Journal of Heuristics, 3, 111-137.
14. DEMIRKOL, E., MEHTA, S. V. and UZSOY, R., 1998, Benchmarks for shop scheduling problems. European Journal of Operational Research, 109, 137-141.
15. DORNDORF, U. and PESCH, E., 1995, Evolution based learning in a job shop scheduling environment. Computers and Operations Research, 22, 25-40.
16. Fox, M. S., 1990, Constraint-guided scheduling - a short history of research at CMU. Computers in Industry, 14, 79-88.
17. Fox, M. S. and SMITH, S. F. 1984, ISIS - A knowledge-based system for factory scheduling. Expert Systems, 1, 25-49.
18. GAREY, M. R. and JOHNSON, D. S., 1979, Computer and Intractability: a Guide to the Theory of NP-Completeness (San Francisco, CA: W. H. Freeman).
19. 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.
20. KEMPF, K., RUSSELL, B., SIDHU, S. and BARRETT, S., 1991, Artificially intelligent schedulers in manufacturing practice. AI Magazine, 11, 46-56.
21. LAMATSCH, A., MORLOCK, M., NEUMANN, K. and RUBACH, T., 1988, SCHEDULE - an expert-like system for machine scheduling. Annals of Operations Research, 16, 425-438.
22. 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).
23. LUH, P. B. and HOITOMT, D. J., 1993, Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Transactions on Automatic Control, 38, 1066-1079.
24. 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.
25. MONTGOMERY, D. C., 1997, Design and Analysis of Experiments (New York: Wiley).
26. NOWICKI, E. and SMUTNICKI, C., 1996, A fast taboo search algorithm for the job shop problem. Management Science, 42, 797-813.
27. OVACIK, I. M. and UZSOY, R., 1997, Decomposition Methods for Complex Factory Scheduling Problems (Dordrecht: Kluwer).
28. PINEDO, M. and SINGER, M., 1999, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46, 1-17.
29. ROY, B. and SUSSMANN, B., 1964, Les Problems d'Ordonnancement avec des Contraintes Disjonctives. Note DS No. 9 bis (Montrouge: SEMA).
30. SADEH, N., 1991, Look-ahead techniques for micro-opportunistic job shop scheduling. PhD thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.
31. 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.
32. SUN, X. and NOBLE, J. S., 1999, An approach to job shop scheduling with sequence-dependent setups. Journal of Manufacturing Systems, 18, 416-430.
33. UZSOY, R. and DEMIRKOL, E., 2000, Decomposition methods for scheduling reentrant flow shops with sequence dependent setup times. Journal of Scheduling, 3, 155-177.
34. UZSOY, R. and WANG, C. S., 2000, Performance of decomposition algorithms for job shop scheduling problems with bottleneck machines. International Journal of Production Research, 38, 1271-1286.
35. 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.