Performance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach

• A stochastic dynamic job shop scheduling problem with sequence-dependent setup times is studied.
• The two levels of each shop utilization and setup time are considered.
• The performance of different dispatching rules is assessed.
• There is no single dispatching rule that performs well under all conditions.
• The change in shop utilization level and setup time level has significant impact on system performance.

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures viewpoint. A discrete event simulation model of a stochastic dynamic job shop manufacturing system is developed for investigation purpose. Nine dispatching rules identified from literature are incorporated in the simulation model. The simulation experiments are conducted under different levels of shop utilization and setup time. The important aspects of the results of the simulation investigation are also discussed in detail.