A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.

[1]  Wen-Hwa Yang,et al.  Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..

[2]  In-Chan Choi,et al.  Job shop scheduling with separable sequence-dependent setups , 1997, Ann. Oper. Res..

[3]  N. Qi,et al.  Application of Taguchi’s method in the optimization of bridging efficiency between confluent and fresh microcarriers in bead-to-bead transfer of Vero cells , 2008, Biotechnology Letters.

[4]  T. R. Bement,et al.  Taguchi techniques for quality engineering , 1995 .

[5]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

[6]  Tai-Hsi Wu,et al.  A simulated annealing algorithm for manufacturing cell formation problems , 2008, Expert Syst. Appl..

[7]  V. Vinod,et al.  Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study , 2008 .

[8]  William G. Cochran,et al.  Experimental designs, 2nd ed. , 1957 .

[9]  James S. Noble,et al.  An approach to job shop scheduling with sequence-dependent setups , 1999 .

[10]  Fariborz Jolai,et al.  A variable neighborhood search for job shop scheduling with set-up times to minimize makespan , 2009, Future Gener. Comput. Syst..

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

[12]  Jin-Kao Hao,et al.  An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem , 2008, Comput. Oper. Res..

[13]  Pius J. Egbelu,et al.  Scheduling in a manufacturing shop with sequence-dependent setups , 1989 .

[14]  S. F. Fatemi Ghomi,et al.  Scheduling job shop problems with sequence-dependent setup times , 2009 .

[15]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[16]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

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

[18]  Yih-Long Chang,et al.  A scatter search approach to sequence-dependent setup times job shop scheduling , 2009 .

[19]  Pierre Lopez,et al.  Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis , 2005, Ann. Oper. Res..

[20]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[21]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[22]  Raid Al-Aomar,et al.  Incorporating robustness into Genetic Algorithm search of stochastic simulation outputs , 2006, Simul. Model. Pract. Theory.

[23]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

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

[25]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[26]  Christian Artigues,et al.  An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times , 2002 .

[27]  Hark Hwang,et al.  Job shop scheduling with sequence dependent setup times to minimize makespan , 2003 .

[28]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[29]  Beatrice M. Ombuki-Berman,et al.  Local Search Genetic Algorithms for the Job Shop Scheduling Problem , 2004, Applied Intelligence.

[30]  J. M. J. Schutten.  Practical job shop scheduling , 1998, Ann. Oper. Res..

[31]  Jianguo Yang,et al.  Study on job shop scheduling with sequence-dependent setup times using biological immune algorithm , 2006 .

[32]  Sushil K. Gupta.  n jobs and m machines job-shop problems with sequence-dependent set-up times , 1982 .

[33]  I. Choi,et al.  A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups , 2002 .

[34]  B. Jay Coleman.  TECHNICAL NOTE: A SIMPLE MODEL FOR OPTIMIZING THE SINGLE MACHINE EARLY/TARDY PROBLEM WITH SEQUENCE‐DEPENDENT SETUPS , 2009 .

[35]  Madhan Shridhar Phadke,et al.  Quality Engineering Using Robust Design , 1989 .

[36]  William G. Cochran,et al.  Experimental Designs, 2nd Edition , 1950 .

[37]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

[38]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[39]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..