By Topic

Application of genetic algorithm to a large-scale scheduling problem for a metal mold assembly process

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

4 Author(s)
N. Sannomiya ; Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan ; H. Iima ; K. Ashizawa ; Y. Kobayashi

A genetic algorithm is applied to an optimal scheduling problem for a metal mold assembly process. The process is operated basically in a job shop mode with additional constraints, such as the precedence constraints among jobs and the allocation of each operation to different kinds of parallel machines. The objective of the problem is to minimize the sum of the tardiness of each job. Furthermore, the problem is large-scale because of a long scheduling period. In the design of genetic algorithm an individual description and genetic operators are proposed to satisfy the constraints. A method for decomposing the set of jobs is also proposed to cope with the large-scale problem. In order to examine the effectiveness of the algorithm, a simulation is carried out on the basis of large-scale operation data

Published in:

Decision and Control, 1999. Proceedings of the 38th IEEE Conference on  (Volume:3 )

Date of Conference:

1999