By Topic

On the fuzzy scheduling for flow shop jobs by using 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)
Okabe, T. ; Fac. of Eng., Kyushu Inst. of Technol., Kitakyushu, Japan ; Maeda, M. ; Murakami, S.

Deals with fuzzy scheduling for flow shop jobs. In this scheduling problem, we employ a fuzzy penalty cost function for the delay time of the deadline of a job. The evaluation of job flow (ordering) is done by evaluating some penalty costs for the jobs. To select the best job flow, a genetic algorithm is used. However, under fuzzy evaluation, its solution is not unique and fuzzy valued. Finally, the fuzzy solutions as job flows are shown in a fuzzy Gantt chart

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:4 )

Date of Conference: