Scheduling in job shops with machine breakdowns: An experimental study

Computers and Industrial Engineering

Volumn 36, Issue 1, 1999, Pages 137-162

  Holthaus, Oliver ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER SIMULATION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PREVENTIVE MAINTENANCE; PROCESS CONTROL; SCHEDULING; SENSITIVITY ANALYSIS;

DISPATCHING RULES; JOB SHOP SCHEDULING; MACHINE BREAKDOWNS;

PRODUCTION CONTROL;

EID: 0032668814     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00006-6     Document Type: Article

References (19)

1. Baker K.R. Introduction to sequencing and scheduling. 1974;Wiley, New York.
2. Baker K.R., Kanet J.J. Job shop scheduling with modified due dates. Journal of Operations Management. 4:1983;11-22.
3. Baker K.R. Sequencing rules and due date assignments in a job shop. Management Science. 30:1984;1093-1104.
4. Bertrand J.W.M. The use of workload information to control job lateness in controlled and uncontrolled release production systems. Journal of Operations Management. 3:1983;79-92.
5. Blackstone J.H., Phillips D.T., Hogg G.L. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research. 20:1982;27-45.
6. Blazewicz J., Ecker K., Schmidt G., Weglarz J. Scheduling in computer and manufacturing systems. 2nd ed :1994;Springer, Berlin.
7. Conway R.W. Priority dispatching and work in process inventory in a job shop. Journal of Industrial Engineering. 16:1965;123-130.
8. Eilon S., Cotterill D.J. A modified SI rule in job shop scheduling. International Journal of Production Research. 7:1968;135-145.
9. Haupt R. A survey of priority rule-based scheduling. OR Spektrum. 11:1989;3-16.
10. Holthaus O., Rajendran C. New dispatching rules for scheduling in a job shop: an experimental study. International Journal of Advanced Manufacturing Technology. 13:1997;148-153.
11. Holthaus O., Rajendran C. Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics. 48:1997;87-105.
12. Lorenzen T.J., Anderson V.L. Design of experiments: a no-name approach. 1993;Marcel Dekker, New York.
13. Montgomery D.C. Design and analysis of experiments. 3rd ed :1991;Wiley, New York.
14. Panwalkar S.S., Iskander W. A survey of scheduling rules. Operations Research. 25:1977;45-61.
15. Raghu T.S., Rajendran C. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics. 32:1993;301-313.
16. Ramasesh R. Dynamic job shop scheduling: a survey of simulation research. Omega International Journal of Management Science. 18:1990;43-57.
17. Rochette R., Sadowski R.P. A statistical comparison of the performance of simple dispatching rules for a particular set of job shops. International Journal of Production Research. 14:1976;63-75.
18. Russell R.S., Dar-El E.M., Taylor B.W. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research. 25:1987;1523-1540.
19. Shannon J.B. An analysis of the effect of processing time distributions on the performance of job shop scheduling rules. American Institute for Decision Sciences Proceedings, 11th Annual Meeting, St. Louis. 1979;7-106.