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

Abstract 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.

[1]  Chandrasekharan Rajendran,et al.  New dispatching rules for shop scheduling: A step forward , 2000 .

[2]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[3]  Andrea Rossi,et al.  Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method , 2007 .

[4]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

[5]  P. D. D. Dominic,et al.  Efficient dispatching rules for dynamic job shop scheduling , 2003 .

[6]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[7]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[8]  Adil Baykasoglu,et al.  New approaches to due date assignment in job shops , 2008, Eur. J. Oper. Res..

[9]  William G. Ferrell,et al.  Dynamic rescheduling that simultaneously considers efficiency and stability , 2004, Comput. Ind. Eng..

[10]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[11]  V. Vinod,et al.  Dynamic job-shop scheduling with sequence-dependent setup times: simulation modeling and analysis , 2008 .

[12]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[13]  C. T. Baker,et al.  Simulation of a Simplified Job Shop , 1960 .

[14]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[15]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[16]  Yih-Long Chang,et al.  Multi-criteria sequence-dependent job shop scheduling using genetic algorithms , 2009, Comput. Ind. Eng..

[17]  H. Van Dyke Parunak,et al.  Characterizing the manufacturing scheduling problem , 1991 .

[18]  Mingyuan Chen,et al.  Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time , 2012 .

[19]  Bala Ram,et al.  Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups , 2006 .

[20]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[21]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[22]  Chandrasekharan Rajendran,et al.  New dispatching rules for scheduling in a job shop — An experimental study , 1997 .

[23]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[24]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[25]  Jon K. Wilbrecht,et al.  The Influence of Setup Time on Job Shop Performance , 1969 .