Although the problem of scheduling dynamic job shops is well studied, setup and changeover times are often assumed to be negligibly small and therefore ignored. In cases where the product mix changes occur frequently, setup and changeover times are of critical importance. This paper applies some known results from the study of multi-class single-server queues with setup and changeover times to develop an approximation for evaluating the performance of job shops. It is found that the product mix, setup and changeover times, and scheduling rules affect the performance significantly, in particular at high levels of machine utilisation. This approach could be used to determine the required level of flexibility of machines and to choose an appropriate scheduling policy such that production rates remain within acceptable limits for foreseeable changes in the product mix.
[1]
Jack S. Sykes,et al.
Simplified Analysis of an Alternating-Priority Queuing Model with Setup Times
,
1970,
Oper. Res..
[2]
J. A. Buzacott,et al.
On Approximate Queueing Models of Dynamic Job Shops
,
1985
.
[3]
Martin Eisenberg.
Two Queues with Changeover Times
,
1971,
Oper. Res..
[4]
D. P. Gaver,et al.
A comparison of queue disciplines when service orientation times occur
,
1963
.
[5]
A. Alan B. Pritsker,et al.
Introduction to simulation and SLAM II
,
1979
.
[6]
William L. Maxwell,et al.
Theory of scheduling
,
1967
.
[7]
Peter Mevert,et al.
A Priority System with Setup Times
,
1968,
Oper. Res..