Improving job shop performance by coordinating dispatching rules

International Journal of Production Research

Volumn 35, Issue 2, 1997, Pages 539-549

  Holthaus, O ^a   Ziegler, H ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECENTRALIZED CONTROL; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING;

JOB SHOP SCHEDULING;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0031076549     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075497195894     Document Type: Article

References (21)

1. Adams, J., Balas, E. and Zawack, D., 1988, The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (New York: Wiley).
3. Baker, K. R., 1984, Sequencing rules and due-date assignments in a job shop. Management Science, 30, 1093-1104.
4. Bierwirth, C., 1995, A generalized permutation approach to job shop scheduling with genetic algorithms. OR Spektrum, 17, 87-92.
5. Blazewicz, J., Ecker, K., Schmidt, G. and Weglarz, J., 1993, Scheduling in Computer and Manufacturing Systems (Berlin: Springer).
6. Blackstone, J. H., Phillips, D. T. and Hogg, G. L., 1982, A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20, 27-45.
7. Brucker, P., 1995, Scheduling Algorithms (Berlin: Springer).
8. Brucker, P. and Jurisch, B., 1993, A new lower bound for the job-shop scheduling problem. European Journal of Operational Research, 64, 156-167.
9. 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.
10. Gere, W. S., 1966, Heuristics in job shop scheduling. Management Science, 13, 167-190.
11. Haupt, R., 1989, A survey of priority rule-based scheduling. OR Spektrum, 11, 3-16.
12. Holthaus, O., Rosenberg, O. and Ziegler, H., 1993, Verteilte Simulation dezentraler Werkstattfertigungssysteme. Information Management, 8, 6-12.
13. Itoh, K., Huang, D. and Enkawa, T., 1993, Twofold look-ahead search for multicriterion job shop scheduling. International Journal of Production Research, 31, 2215- 2234.
14. Koulamas, C. P. and Smith, M. L., 1988, Look-ahead scheduling for minimizing machine interference. International Journal of Production Research, 26, 1523-1533.
15. Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
16. Nawijn, W. M., 1990, Look-ahead policies for admission to a single server loss system. Operations Research, 38, 854-862.
17. Pinedo, M., 1995, Scheduling: Theory, Algorithms, andSystems (EnglewoodCliffs, NJ: Prentice Hall).
18. Ramasesh, R., 1990, Dynamic job shop scheduling: a survey of simulation research. Omega International Journal of Management Science, 18, 43-57.
19. Russell, R. S., Dar-El, E. M. and Taylor, B. W., 1987, A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research, 25, 1523-1540.
20. Rosenwein, M. B., Stone, R. E. and Wahls, E. T., 1991, Constrained ‘look-ahead’ manufacturing. International Journal of Production Research, 29, 1845-1851.
21. Zeestraten, M. J., 1990, The look-ahead dispatching procedure. International Journal of Production Research, 28, 369-384