By Topic

Research on multiobjective flow shop scheduling with stochastic processing times and machine breakdowns

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
$33 $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)
Qiang Zhou ; Department of Computer Science and Technology, Chuzhou University, China ; Xunxue Cui

Flow-shop scheduling problems are generally studied in a single-objective deterministic way whereas they are multiobjective and are subjected to a wide range of uncertainties. Although evolutionary algorithms are commonly used to solve multiobjective and stochastic problems, very few approaches combine simultaneously these two aspects. In the paper the multiobjective flow shop scheduling problem is modeled with the stochastic processing time and the machine breakdown. A mathematical scheme is designed for the largest flow of time and the largest delay time. A hybrid multiobjective genetic algorithm is proposed to solve the optimization problems iteratively on uncertain condition. The results of simulation experiments are shown that the algorithm can provide a good performance for the flow shop scheduling problems on the uncertain condition.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008