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

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Zheng, T., & Yamashiro, M. (2010). Solving no-wait flow shop scheduling problems by a hybrid quantum-inspired evolutionary algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6438 LNAI, pp. 315–324). https://doi.org/10.1007/978-3-642-16773-7_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free