By Topic

Genetic algorithm approach to an optimal scheduling problem for a large-scale complex manufacturing system

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)
N. Sannomiya ; Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan ; H. Iima

A genetic algorithm (GA) is applied to an optimal scheduling problem for a large-scale complex manufacturing system. The system is operated in a job shop mode with additional constraints and during a long scheduling period. In order to obtain a good suboptimal solution, a GA is designed by introducing several ideas and heuristics for constructing the individual description and the genetic operators. In the paper a long-period scheduling problem for a metal mold assembly process is considered as a case study. The effectiveness of the proposed algorithm is examined by a numerical computation carried out on the basis of large-scale real operation data

Published in:

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

Date of Conference: