Share Email Print
cover

Proceedings Paper

Applications of colored petri net and genetic algorithms to cluster tool scheduling
Author(s): Tung-Kuan Liu; Chih-Jen Kuo; Yung-Chin Hsiao; Jinn-Tsong Tsai; Jyh-Horng Chou
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper, we propose a method, which uses Coloured Petri Net (CPN) and genetic algorithm (GA) to obtain an optimal deadlock-free schedule and to solve re-entrant problem for the flexible process of the cluster tool. The process of the cluster tool for producing a wafer usually can be classified into three types: 1) sequential process, 2) parallel process, and 3) sequential parallel process. But these processes are not economical enough to produce a variety of wafers in small volume. Therefore, this paper will propose the flexible process where the operations of fabricating wafers are randomly arranged to achieve the best utilization of the cluster tool. However, the flexible process may have deadlock and re-entrant problems which can be detected by CPN. On the other hand, GAs have been applied to find the optimal schedule for many types of manufacturing processes. Therefore, we successfully integrate CPN and GAs to obtain an optimal schedule with the deadlock and re-entrant problems for the flexible process of the cluster tool.

Paper Details

Date Published: 2 May 2006
PDF: 6 pages
Proc. SPIE 6042, ICMIT 2005: Control Systems and Robotics, 60420Q (2 May 2006); doi: 10.1117/12.664566
Show Author Affiliations
Tung-Kuan Liu, National Kaohsiung First Univ. of Science and Technology (Taiwan)
Chih-Jen Kuo, National Kaohsiung First Univ. of Science and Technology (Taiwan)
Yung-Chin Hsiao, National Kaohsiung First Univ. of Science and Technology (Taiwan)
Jinn-Tsong Tsai, Kaohsiung Medical Univ. (Taiwan)
Jyh-Horng Chou, National Kaohsiung First Univ. of Science and Technology (Taiwan)


Published in SPIE Proceedings Vol. 6042:
ICMIT 2005: Control Systems and Robotics

© SPIE. Terms of Use
Back to Top