By Topic

Schedulability and Scheduling of Dual-Arm Cluster Tools with Residency Time Constraints Based on Petri Net

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
$31 $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)
NaiQi Wu ; Dept. of Ind. Eng., Guangdong Univ. of Technol., Guangzhou ; MengChu Zhou

Because of residency time constraints for cluster tools, it is very difficult to schedule them. This paper addresses their scheduling issues and conducts their schedulability analysis. A Petri net (PN) model, called resource-oriented PN (ROPN) is developed to model them. Based on it, for the first time, necessary and sufficient conditions under which the system is schedulable are presented. Meanwhile, an algorithm is developed for the scheduling of dual-armed cluster tool. The algorithm finds an optimal periodic schedule analytically if it is schedulable. A method is also presented for the implementation of the obtained cyclic schedule by appropriately controlling the initial transient process. Examples are presented to show the application and power of the theory and algorithm

Published in:

Automation Science and Engineering, 2006. CASE '06. IEEE International Conference on

Date of Conference:

8-10 Oct. 2006