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

  • Bin-Bin Li
  • Ling Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4113)


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.


Pareto Front Flow Shop Schedule Problem Flow Shop Schedule Problem Good Half Permutation Flow Shop Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garey, M.R., Johonson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  2. 2.
    Nawaz, M., Enscore Jr., E., Ham, I.: A Heuristic Algorithm for the M-machine, N-job Flowshop Sequencing Problem. Omega 11, 91–95 (1983)CrossRefGoogle Scholar
  3. 3.
    Ogbu, F.A., Smith, D.K.: Simulated Annealing for the Permutation Flowshop Problem. Omega 19, 64–67 (1990)CrossRefGoogle Scholar
  4. 4.
    Wang, L., Zhang, L., Zheng, D.Z.: A Class of Order-Based Genetic Algorithm for Flow Shop Scheduling. Int. J. Advanced Manufacture Technology 22, 828–835 (2003)CrossRefGoogle Scholar
  5. 5.
    Wang, L., Zheng, D.Z.: A Modified Evolutionary Programming for Flow Shop Scheduling. Int. J. Advanced Manufacturing Technology 22, 522–527 (2003)CrossRefGoogle Scholar
  6. 6.
    Nowicki, E., Smutnicki, C.: A Fast Tabu Search Algorithm For the Permutation Flow-Shop Problem. European J. Operational Research 91, 160–175 (1996)MATHCrossRefGoogle Scholar
  7. 7.
    Wang, L., Zheng, D.Z.: An Effective Hybrid Heuristic for Flow Shop Scheduling. Int. J. Advanced Manufacture Technology 21, 38–44 (2003)CrossRefGoogle Scholar
  8. 8.
    Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithm for a Class of Combinatorial Optimization. IEEE Trans. Evol. Comput. 6, 580–593 (2002)CrossRefGoogle Scholar
  9. 9.
    Han, K.H., Kim, J.H.: A Quantum-Inspired Evolutionary Algorithms with a New Termination Criterion, He gate, and Two-Phase Scheme. IEEE Trans. Evol. Comput. 8, 156–169 (2004)CrossRefGoogle Scholar
  10. 10.
    Bean, J.C.: Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal on Computing 6, 154–160 (1994)MATHGoogle Scholar
  11. 11.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182–197 (2002)CrossRefGoogle Scholar
  12. 12.
    Arroyo, J.E.C., Armentano, V.A.: Genetic Local Search for Multi-Objective Flowshop Scheduling Problems. European J. Operational Research 167, 717–738 (2005)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Trans. Evol. Comput. 1, 67–82 (1997)CrossRefGoogle Scholar
  14. 14.
    Taillard, E.: Benchmarks for Basic Scheduling Problems. European J. Operational Research 64, 278–285 (1993)MATHCrossRefGoogle Scholar
  15. 15.
    Jaszkiewicz, A.: Do Multiple-Objective Metaheuristcs Deliver on their Promises? A Computational Experiment on the Set-Covering Problem. IEEE Trans. Evol. Comput. 7, 133–143 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bin-Bin Li
    • 1
  • Ling Wang
    • 1
  1. 1.Department of AutomationTsinghua UniversityBeijingChina

Personalised recommendations