By Topic

A novel quantum differential evolutionary algorithm for non-permutation flow shop scheduling problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng, T. ; SoftAgency Co., Ltd., Oyama, Japan ; Yamashiro, M.

This paper is the first to propose a novel quantum differential evolutionary algorithm (QDEA) based on the basic quantum-inspired evolutionary algorithm (QEA) for the non-permutation flow-shop scheduling problem (NPFSP). In this QDEA, the quantum chromosomes are encoded by using the quantum rotating angle and a simple converting mechanism for determining job sequence is proposed for the representation of NPFSP firstly. Then we merge the advantages of differential operation, local search and QEA by adopting the differential operation to perform the updating of quantum gate and the local search to perform exploitation in the promising permutative-based solutions. We adopt this approach to minimize the makespan for NPFSP and make the simulation. The comparisons with other state-of-the-art approaches based on well-known benchmarks demonstrate the effectiveness of the proposed QDEA.

Published in:

Electrical Engineering Computing Science and Automatic Control (CCE), 2010 7th International Conference on

Date of Conference:

8-10 Sept. 2010