Solving flow shop scheduling problems by quantum differential evolutionary algorithm

This paper proposed a novel quantum differential evolutionary algorithm (QDEA) based on the basic quantum-inspired evolutionary algorithm (QEA) for permutation flow shop scheduling problem (PFSP). In this QDEA, the quantum chromosomes are encoded and decoded by using the quantum rotating angle and a simple strategy named largest rotating angle value rule to determine job sequence based on job’s quantum information is proposed for the representation of PFSP, firstly. Then, we merge the advantages of differential evolution strategy, variable neighborhood search and QEA by adopting the differential evolution to perform the updating of quantum gate and variable neighborhood search to raise the performance of the local search. We adopted QDEA to minimize the makespan, total flowtime and the maximum lateness of jobs and make the simulations. The results and comparisons with other algorithms based on famous benchmarks demonstrated the effectiveness of the proposed QDEA. Another contribution of this paper is to report new absolute values of total flowtime and maximum lateness for various benchmark problem sets.

[1]  Jack Heller,et al.  Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects , 1960 .

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

[3]  Jacques Carlier,et al.  Ordonnancements à contraintes disjonctives , 1978 .

[4]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[5]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[6]  D. Chaudhuri,et al.  A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME , 1991 .

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

[8]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[9]  Hideo Tanaka,et al.  Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .

[10]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[11]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[12]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[13]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[14]  R. Storn,et al.  Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces , 2004 .

[15]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[16]  Reha Uzsoy,et al.  Benchmarks for shop scheduling problems , 1998, Eur. J. Oper. Res..

[17]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[18]  Jiyin Liu,et al.  Constructive and composite heuristic solutions to the P// Sigma Ci scheduling problem , 2001, Eur. J. Oper. Res..

[19]  A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization , 2001, EvoWorkshops.

[20]  Jong-Hwan Kim,et al.  Parallel quantum-inspired genetic algorithm for combinatorial optimization problem , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[21]  Clarisse Dhaenens,et al.  A Hybrid Evolutionary Approach for Multicriteria Optimization Problems: Application to the Flow Shop , 2001, EMO.

[22]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[23]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[24]  J. Framiñan,et al.  An efficient constructive heuristic for flowtime minimisation in permutation flow shops , 2003 .

[25]  Pierre Hansen,et al.  A Tutorial on Variable Neighborhood Search , 2003 .

[26]  S. Ponnambalam,et al.  A TSP-GA multi-objective algorithm for flow-shop scheduling , 2004 .

[27]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

[28]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[29]  Mehmet Sevkli,et al.  Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness Minimization in Permutation Flowshop Sequencing Problem , 2004 .

[30]  Andreas C. Nearchou,et al.  A novel metaheuristic approach for the flow shop scheduling problem , 2004, Eng. Appl. Artif. Intell..

[31]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithms with a new termination criterion, H/sub /spl epsi// gate, and two-phase scheme , 2004, IEEE Transactions on Evolutionary Computation.

[32]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[33]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

[34]  Hao Wu,et al.  A Quantum-Inspired Genetic Algorithm for Scheduling Problems , 2005, ICNC.

[35]  Tarek A. El-Mihoub,et al.  Hybrid Genetic Algorithms: A Review , 2006, Eng. Lett..

[36]  R. K. Suresh,et al.  Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan , 2005, ICNC.

[37]  Chandrasekharan Rajendran,et al.  Two ant-colony algorithms for minimizing total flowtime in permutation flowshops , 2005, Comput. Ind. Eng..

[38]  Zhixiong Liu,et al.  Hybrid Particle Swarm Optimization for Permutation Flow Shop Scheduling , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[39]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multi-objective Scheduling , 2006, ICIC.

[40]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[41]  Kevin Kok Wai Wong,et al.  Classification of adaptive memetic algorithms: a comparative study , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[42]  S.G. Ponnambalam,et al.  A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems , 2006, 2006 IEEE Conference on Cybernetics and Intelligent Systems.

[43]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[44]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[45]  Reza Tavakkoli-Moghaddam,et al.  A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness , 2007, Inf. Sci..

[46]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[47]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[48]  Mehmet Fatih Tasgetiren,et al.  A discrete differential evolution algorithm for the permutation flowshop scheduling problem , 2008, Comput. Ind. Eng..

[49]  Ling Wang,et al.  A hybrid differential evolution method for permutation flow-shop scheduling , 2008 .

[50]  Bassem Jarboui,et al.  A combinatorial particle swarm optimisation for solving permutation flowshop problems , 2008, Comput. Ind. Eng..

[51]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[52]  Lin-Yu Tseng,et al.  A hybrid genetic local search algorithm for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[53]  Rubén Ruiz,et al.  New high performing heuristics for minimizing makespan in permutation flowshops , 2009 .

[54]  Wojciech Boejko,et al.  Solving the flow shop problem by parallel programming , 2009 .

[55]  P. Shahabudeen,et al.  An improved genetic algorithm for the flowshop scheduling problem , 2009 .

[56]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[57]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[58]  Pei-Chann Chang,et al.  A Hybrid Genetic-Immune Algorithm with Improved Offsprings and Elitist Antigen for Flow-Shop Scheduling Problems , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[59]  Yi Pan,et al.  An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model , 2009, Expert Syst. Appl..

[60]  Wen-Chiung Lee,et al.  A note on the total completion time problem in a permutation flowshop with a learning effect , 2009, Eur. J. Oper. Res..

[61]  Scheduling jobs on flowshop environment applying simulated annealing algorithm , 2009 .

[62]  Jigui Sun,et al.  An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem , 2009, Expert Syst. Appl..

[63]  Uday K. Chakraborty,et al.  An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling , 2009 .

[64]  Xiaoping Li,et al.  Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization , 2009, Eur. J. Oper. Res..

[65]  A. Rahimi-Vahed,et al.  A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem , 2009 .

[66]  Rubén Ruiz,et al.  Cooperative metaheuristics for the permutation flowshop scheduling problem , 2009, Eur. J. Oper. Res..

[67]  Subhash C. Sarin,et al.  A heuristic to minimize total flow time in permutation flow shop , 2009 .

[68]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[69]  Q. Wang,et al.  Efficient composite heuristics for total flowtime minimization in permutation flow shops , 2009 .

[70]  Reza Tavakkoli-Moghaddam,et al.  Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan , 2010, Knowl. Based Syst..

[71]  L. Tang,et al.  New heuristics for flow shop problem to minimize makespan , 2010, J. Oper. Res. Soc..

[72]  Dantong Ouyang,et al.  A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem , 2010, Comput. Ind. Eng..

[73]  K. Sheibani,et al.  A fuzzy greedy heuristic for permutation flow-shop scheduling , 2010, J. Oper. Res. Soc..