Solving no-wait flow shop scheduling problems by a hybrid quantum-inspired evolutionary algorithm

  • Authors:
  • Tianmin Zheng;Mitsuo Yamashiro

  • Affiliations:
  • SoftAgency Co., Ltd. Oyama, Tochigi, Japan;Ashikaga Institute of Technology, Ashikaga, Tochigi, Japan

  • Venue:
  • MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is the first to consider the hybrid quantum-inspired evolutionary algorithm (HQEA) on the no-wait permutation flow shop scheduling problem (PFSP) for minimizing the makespan. In this HQEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple but efficient converting mechanism for determining job sequence is proposed for the representation of solution firstly. Then, we adopt differential operation to perform the updating of quantum gate and the local search to perform exploitation in the promising permutation-based solutions. We make the simulations on famous benchmarks and the comparisons with other state-of-the-art approaches demonstrate the effectiveness of the proposed HQEA for no-wait flow shop scheduling problem.