By Topic

Solving stochastic earliness and tardiness parallel machine scheduling using Quantum Genetic Algorithm

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

3 Author(s)
Jinwei Gu ; Dept. of Inf. Sci. & Eng., East China Univ. of Sci. & Technol., Shanghai ; Xingsheng Gu ; Bin Jiao

Based on the analysis of the stochastic earliness and tardiness parallel machine scheduling, a Quantum Genetic Scheduling Algorithm (QGSA) is presented. In the QGSA, the Q-bit based representation in discrete 0-1 hyperspace is employed, which is then converted into decimal scheduling code and quantum gate is used to update the current generation, meanwhile catastrophe operator is added to avoid premature. In contrast to the deterministic scheduling model where jobs with their processing time are known beforehand, we propose a stochastic expected value model based on stochastic programming theory. The simulation results demonstrate that QGSA can get better scheduling solution, even with a small population, without premature convergence as compared to the conventional Genetic Algorithm (GA).

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008