Machine criticality measures and subproblem solution procedures in shifting bottleneck methods: A computational study

Journal of the Operational Research Society

Volumn 47, Issue 5, 1996, Pages 666-677

  Holtsclaw, Harry H ^a   Uzsoy, Reha ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Computational analysis; Heuristics; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; INDUSTRIAL ENGINEERING; OPTIMIZATION; PRODUCTION CONTROL; RANDOM PROCESSES; SCHEDULING;

BALANCED WORKLOAD; COMPUTATIONAL ANALYSIS; DISPATCHING RULES; EARLIEST DUE DATE; JOB SHOP; MACHINE CRITICALITY MEASURES; SHIFTING BOTTLENECK; SHORTEST PROCESSING TIME; SUBPROBLEM SOLUTION PROCEDURES;

OPERATIONS RESEARCH;

EID: 0030151057     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.78     Document Type: Article

References (23)

1. B. J. Lageweg, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan (1981) Computer-Aided Complexity Clasifica- tion of Deterministic Scheduling Problems. Report No. BW138, Mathematisch Centrum, Amsterdam.
2. M. R. Garey and D. S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco.
3. D. Applegate and W. Cook (1991) A computational study of the job shop scheduling problem. ORSA J. Computing 3, 149-156.
4. J. Carlier and E. Pinson (1989) An algorithm for solving the job-shop problem. Mgmt Sci. 35, 164-176.
5. K. Bhaskaran and M. Pinedo (1991) Dispatching. In Handbook of Industrial Engineering (G. Salvendy, Ed.) pp 2182-2198. J. Wiley, New York.
6. J. H. Blackstone, D. T. Phillips and G. L. Hogg (1982) A state-of-the-art survey of dispatching for manufacturing job shop operations. Int. J. Prod. Res. 20, 27-45.
7. H. Matsuo, C. J. Suh and R. S. Sullivan (1988) A Controlled Search Simulated Annealing Approach for the General Job Shop Scheduling Problem. Department of Management, Graduate School of Business, University of Texas at Austin.
8. E. Taillard (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Computing 6, 108-117.
9. J. Adams, E. Balas and D. Zawack (1988) The shifting bottleneck procedure for job-shop scheduling. Mgmt Sci. 34, 391-401.
10. I. M. Ovacik and R. Uzsoy (1992) A shifting bottleneck algorithm for scheduling semiconductor testing operations. J. Electronics Mfg 2, 119-134.
11. S. Dauzere-Peres and J. B. Lasserre (1993) A modified shifting bottleneck procedure for job shop scheduling. Int. J. Prod. Res. 31, 923-932.
12. E. Balas, J. K. Lenstra and A. Vazacopoulos (1995) One machine scheduling with delayed precedence constraints. Mgmt Sci. 41, 94-109.
13. J. Carlier (1982) The one-machine scheduling problem. Eur. J. Opl Res. 11, 42-47.
14. L. A. Hall and D. B. Shmoys (1992) Jackson’s rule for single-machine scheduling: making a good heuristic better. Math. Opns Res. 17, 22-35.
15. C. N. Potts (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Opns Res. 28, 1436-1441.
16. K. R. Baker and Z. S. Su (1974) Sequencing with due dates and early start times to minimize maximum tardiness. Naval Res. Logist. Q. 21, 171-176.
17. J. F. Muth and G. L. Thompson (1963) Industrial Scheduling. Prentice Hall, Englewood Cliffs, NJ.
18. T. E. Morton (1990) Shifting Bottleneck Methods in Job Shop and Project Scheduling: Tutorial and Research Directions. Graduate School of Industrial Administration, Carnegie Mellon University.
19. K. R. Baker (1974) Introduction to Sequencing and Scheduling. John Wiley, New York.
20. N. Sadeh (1991) Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling. Ph.D. Dissertation, Robotics Institute, Carnegie Mellon University.
21. R. H. Storer, S. D. Wu and R. Vaccari (1992) New search spaces for sequencing problems with application to job shop scheduling. Mgmt Sci. 38, 1495-1509.
22. J. K. Lenstra (1977) Sequencing by Enumerative Methods. Mathematical Centre Tract 69, Mathematisch Centrum, Amsterdam.
23. I. M. Ovacik and R. Uzsoy (1994) Decomposition Methods for Scheduling Complex Job Shops: An Application to Semiconductor Testing Operations. Research Report, School of Industrial Engineering, Purdue University.