Schedulability analysis and optimal scheduling of dual-arm cluster tools with residency time constraint and activity time variation

213Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

Abstract

With wafer residency time constraint of cluster tools in semiconductor manufacturing, activity time variation can make an originally feasible schedule infeasible. Thus, it is difficult to schedule them and schedulability is a vitally important issue. With bounded activity time variation considered, this paper addresses their real-time scheduling issues and conducts their schedulability analysis. A Petri net (PN) model and a control policy are presented. Based on them, this paper derives closed-form schedulability conditions. If schedulable, an algorithm is developed to obtain an offline periodic schedule. This schedule together with the control policy forms a real-time schedule. It is optimal in terms of cycle time and can be analytically computed, which represents significant advance in this area. © 2006 IEEE.

Cite

CITATION STYLE

APA

Wu, N. Q., & Zhou, M. C. (2012). Schedulability analysis and optimal scheduling of dual-arm cluster tools with residency time constraint and activity time variation. IEEE Transactions on Automation Science and Engineering, 9(1), 203–209. https://doi.org/10.1109/TASE.2011.2160452

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free