Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/87749
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Fajunen_US
dc.contributor.authorWu, Naiqien_US
dc.contributor.authorQiao, Yanen_US
dc.contributor.authorZhou, Mengchuen_US
dc.contributor.authorSu, Rong.en_US
dc.contributor.authorQu, Tingen_US
dc.date.accessioned2018-08-07T06:23:49Zen
dc.date.accessioned2019-12-06T16:48:37Z-
dc.date.available2018-08-07T06:23:49Zen
dc.date.available2019-12-06T16:48:37Z-
dc.date.issued2017-
dc.identifier.citationYang, F., Wu, N., Qiao, Y., Zhou, M., Su, R., & Qu, T. (2018). Petri net-based efficient determination of optimal schedules for transport-dominant single-arm multi-cluster tools. IEEE Access, 6, 355-365. doi: 10.1109/ACCESS.2017.2763778en_US
dc.identifier.issn2169-3536en_US
dc.identifier.urihttps://hdl.handle.net/10356/87749-
dc.description.abstractIt is a great challenge to find an optimal one-wafer cyclic schedule for a single-arm multicluster tool that is widely adopted in semiconductor fabrication. Aiming to tackle this significant problem, an optimal scheduling strategy is determined first for each individual tool under the condition that the bottleneck individual tool is transport-bound. Then, by developing a Petri net model with robot waiting being explicitly described to reveal the properties of the entire system, this paper shows that to schedule such a tool optimally is to allocate the robot waiting time properly. Then, this paper presents the necessary and sufficient conditions for the existence of an optimal one-wafer cyclic schedule. Thereafter, an efficient algorithm is developed to check the given conditions and find such a schedule efficiently if existing. Finally, two industrial examples are used to verify that the proposed method is applicable and effective.en_US
dc.description.sponsorshipNRF (Natl Research Foundation, S’pore)en_US
dc.format.extent11 p.en
dc.language.isoenen_US
dc.relation.ispartofseriesIEEE Accessen
dc.rightsThis journal is 100% open access, which means that all content is freely available without charge to users or their institutions. Articles accepted before 12 June 2019 were published under a CC BY 3.0 or the IEEE Open Access Publishing Agreement license. Questions about copyright policies or reuse rights may be directed to the IEEE Intellectual Property Rights Office at +1-732-562-3966 or copyrights@ieee.org.en_US
dc.subjectSchedulingen_US
dc.subjectPetri Neten_US
dc.titlePetri net-based efficient determination of optimal schedules for transport-dominant single-arm multi-cluster toolsen_US
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.identifier.doi10.1109/ACCESS.2017.2763778-
dc.description.versionPublished versionen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:EEE Journal Articles

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.