2009 21st IEEE International Conference on Tools with Artificial Intelligence Dedicated Machine Constraint Scheduling as a Shortest-Path Problem Newark, New Jersey November 02-November 04 ISBN: 978-0-7695-3920-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2009.13
This paper proposes a graph framework to undertake the issue of scheduling for dedicated machine constraint in the semiconductor manufacturing system. By finding the shortest paths in the graph, the framework finds the best scheduling result with an optimal makespan for the system. The framework first constructs a graph based on the current situation and then schedules wafers to machines under the constraint. Experiments are presented to validate the proposed graph framework.
Index Terms:
Dedicated Machine Constraint, scheduling, semiconductor manufacturing, shortest path
Citation:
Huy Nguyen Anh Pham, Arthur Shr, Peter P. Chen, "Dedicated Machine Constraint Scheduling as a Shortest-Path Problem," ictai, pp.559-566, 2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb