A Hybrid Quantum-Inspired Genetic Algorithm for Multi-objective Scheduling

This paper proposes a hybrid quantum-inspired genetic algorithm (HQGA) for multi-objective flow shop scheduling problem. On one hand, a quantum-inspired GA (QGA) based on Q-bit representation is applied for exploration in discrete 0-1 hyperspace by using updating operator of quantum gate and genetic operators of Q-bit. Random key representation is used to convert the Q-bit representation to job permutation. On the other hand, permutation-based GA (PGA) is applied for both performing exploration in permutation-based scheduling space and stressing exploitation for good schedule solutions. To evaluate solutions in multi-objective sense, randomly weighted linear sum function is used in QGA, while non-dominated sorting techniques including classification of Pareto fronts and fitness assignment are applied in PGA regarding to both proximity and diversity of solutions in multi-objective sense. Simulation results and comparisons demonstrate the effectiveness and robustness of the proposed HQGA.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[4]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[5]  Ling Wang,et al.  A class of order-based genetic algorithm for flow shop scheduling , 2003 .

[6]  Andrzej Jaszkiewicz,et al.  Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..

[7]  Hark Hwang,et al.  Another similarity coefficient for the p-median model in group technology , 2003, Int. J. Manuf. Technol. Manag..

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

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

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

[11]  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.

[12]  Ling Wang,et al.  A modified evolutionary programming for flow shop scheduling , 2003 .

[13]  Vinícius Amaral Armentano,et al.  Genetic local search for multi-objective flowshop scheduling problems , 2005, Eur. J. Oper. Res..

[14]  Dk Smith,et al.  Simulated annealing for the permutation flowshop problem , 1991 .

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

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