A GA embedded dynamic search algorithm over a Petri net model for an FMS scheduling
Resource
Robotics and Automation, 1997. Proceedings., 1997 IEEE International Conference on
Journal
IEEE International Conference on Robotics and Automation, 1997
Pages
-
Date Issued
1997-04
Date
1997-04
Author(s)
Chiu, Yung-Feng
DOI
N/A
Abstract
In this paper, a genetic algorithm (GA) embedded dynamic search strategy over a Petri net model provides a new scheduling method for a flexible manufacturing system (FMS). The chromosome representation of the search nodes is constructed directly from the Petri net model of an FMS, recording the information about all conflict resolutions, such as resource assignments and orders for resource allocation. The GA operators may enforce some change to the chromosome information in the next generation. A Petri net based schedule builder receives a chromosome and an initial marking as input, and then produces a near-optimal schedule. Due to the NP-complete nature of the scheduling problem of an FMS, we also propose a dynamic FMS scheduler incorporating the proposed GA embedded search scheme, which generates successive partial schedules, instead of generating a full schedule for all raw parts, as the production evolves.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00620088.pdf
Size
672.52 KB
Format
Adobe PDF
Checksum
(MD5):1441f86f24b6765445813615414dc702