Cart (Loading....) | Create Account
Close category search window
 

A genetic algorithm for solving flow shop scheduling problems with parallel machine and special procedure constraints

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)
Yi Wu ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Min Liu ; Cheng Wu

In this paper, flow shop scheduling problem (FSSP) with parallel machine and special procedure constraint is studied. The scheduling objective is to minimize the makespan, and a genetic algorithm is presented for solving the optimization scheduling problem. Researches are made in aspects such as problem modeling, coding (decoding), crossover and mutation of genetic algorithm and so on. Digital computation results show the effectiveness of the proposed genetic algorithm.

Published in:

Machine Learning and Cybernetics, 2003 International Conference on  (Volume:3 )

Date of Conference:

2-5 Nov. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.