Petri Net Modeling and Scheduling of a Close-Down Process for Time-Constrained Single-Arm Cluster Tools

In wafer fabrication, a robotic cluster tool is required to be closed down in order for engineers to perform its on-demand and preventive maintenance and switch between different wafer lots. They often deal with a close-down process subject to wafer residency time constraints, i.e., a wafer must exi...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on systems, man, and cybernetics. Systems Vol. 48; no. 3; pp. 389 - 400
Main Authors Zhu, QingHua, Zhou, MengChu, Qiao, Yan, Wu, NaiQi
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract In wafer fabrication, a robotic cluster tool is required to be closed down in order for engineers to perform its on-demand and preventive maintenance and switch between different wafer lots. They often deal with a close-down process subject to wafer residency time constraints, i.e., a wafer must exit from a processing chamber before its quality degradation within a certain time limit. To obtain higher yield, it is very important to optimize a close-down process for a cluster tool. Yet the existing literature pays no or little attention to this issue. By focusing on a time-constrained single-arm cluster tool, this paper intends: 1) to build its Petri net model to analyze its schedulability and 2) to develop computationally efficient algorithms to find an optimal and feasible schedule for its closing-down process under different workloads at its steps. Industrial examples are used to illustrate the application of the proposed method.
AbstractList In wafer fabrication, a robotic cluster tool is required to be closed down in order for engineers to perform its on-demand and preventive maintenance and switch between different wafer lots. They often deal with a close-down process subject to wafer residency time constraints, i.e., a wafer must exit from a processing chamber before its quality degradation within a certain time limit. To obtain higher yield, it is very important to optimize a close-down process for a cluster tool. Yet the existing literature pays no or little attention to this issue. By focusing on a time-constrained single-arm cluster tool, this paper intends: 1) to build its Petri net model to analyze its schedulability and 2) to develop computationally efficient algorithms to find an optimal and feasible schedule for its closing-down process under different workloads at its steps. Industrial examples are used to illustrate the application of the proposed method.
Author Qiao, Yan
Zhu, QingHua
Zhou, MengChu
Wu, NaiQi
Author_xml – sequence: 1
  givenname: QingHua
  surname: Zhu
  fullname: Zhu, QingHua
  email: zhuqh@gdut.edu.cn
  organization: School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China
– sequence: 2
  givenname: MengChu
  orcidid: 0000-0002-5408-8752
  surname: Zhou
  fullname: Zhou, MengChu
  email: zhou@njit.edu
  organization: Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA
– sequence: 3
  givenname: Yan
  surname: Qiao
  fullname: Qiao, Yan
  email: yqiao@must.edu.mo
  organization: Institute of Systems Engineering, Macau University of Science and Technology, Macau, China
– sequence: 4
  givenname: NaiQi
  surname: Wu
  fullname: Wu, NaiQi
  email: nqwu@must.edu.mo
  organization: Institute of Systems Engineering, Macau University of Science and Technology, Macau, China
BookMark eNp9kE1PwkAQhjcGExH5AcbLJp6Ls7Pttj2S-pmAkoDnpmynWFJ2cbfE-O8tQjh48DQzyfvMZJ5L1jPWEGPXAkZCQHq3mE-zEYJQI4zSRII8Y30UKgkQJfZOvVAXbOj9GgAEJkqC6rPVjFpX81dq-dSW1NRmxQtT8rn-oHL3O9qKFzxrrKfg3n4ZPnNWk_e8so4v6g0FmTW-dUVtqOM6oqFg7DYdsvMtdRlrG3_Fzqui8TQ81gF7f3xYZM_B5O3pJRtPAo2pbIOySDFUESmFUYJ6KQAkgo6FBqkSFJRquSxJVFWVlhhHYRJRqjSEQPEyASkH7Pawd-vs5458m6_tzpnuZI4AGKYKorhLiUNKO-u9oyrfunpTuO9cQL5Xmu-V5nul-VFpx8R_GF23RVtbs_-9-Ze8OZA1EZ0uxVGMiKH8Acf1hBU
CODEN ITSMFE
CitedBy_id crossref_primary_10_1109_ACCESS_2019_2921884
crossref_primary_10_1109_TASE_2020_3014078
crossref_primary_10_1109_ACCESS_2019_2923624
crossref_primary_10_1109_JAS_2023_123189
crossref_primary_10_1109_ACCESS_2019_2899190
crossref_primary_10_1109_TASE_2023_3275703
crossref_primary_10_1109_TSM_2018_2811125
crossref_primary_10_1109_ACCESS_2019_2895348
crossref_primary_10_1016_j_ins_2018_11_023
crossref_primary_10_1109_ACCESS_2019_2896079
crossref_primary_10_1109_TSMC_2019_2944866
crossref_primary_10_3390_math7090812
crossref_primary_10_1016_j_sysarc_2022_102788
crossref_primary_10_1109_TASE_2020_3002560
crossref_primary_10_1109_ACCESS_2017_2777438
crossref_primary_10_1109_TASE_2024_3399818
crossref_primary_10_1109_ACCESS_2019_2899316
crossref_primary_10_1109_TSM_2017_2721970
crossref_primary_10_1109_ACCESS_2018_2875074
crossref_primary_10_1016_j_cja_2020_02_026
crossref_primary_10_1109_ACCESS_2018_2890070
crossref_primary_10_1109_TSMC_2019_2930736
crossref_primary_10_3390_info14110589
crossref_primary_10_1109_ACCESS_2019_2920677
crossref_primary_10_1109_ACCESS_2019_2906324
crossref_primary_10_1109_LRA_2024_3396112
crossref_primary_10_1016_j_jclepro_2019_07_053
crossref_primary_10_1109_TASE_2018_2874664
crossref_primary_10_3390_app15020680
crossref_primary_10_1016_j_ins_2019_05_021
crossref_primary_10_1109_ACCESS_2020_2988274
crossref_primary_10_3390_sym14051052
crossref_primary_10_1109_TCST_2019_2894566
crossref_primary_10_1016_j_isatra_2019_02_003
crossref_primary_10_1080_21681015_2022_2031323
crossref_primary_10_1109_TASE_2020_2983672
crossref_primary_10_1109_TASE_2018_2878063
crossref_primary_10_1109_TSMC_2019_2917882
crossref_primary_10_1109_TASE_2017_2690443
crossref_primary_10_1016_j_ifacol_2018_06_309
crossref_primary_10_1109_TSMC_2022_3222915
crossref_primary_10_1080_0951192X_2024_2397822
crossref_primary_10_1109_ACCESS_2023_3269802
crossref_primary_10_1109_ACCESS_2020_2971650
crossref_primary_10_1109_TCST_2019_2902329
crossref_primary_10_1109_TSMC_2018_2817492
crossref_primary_10_1109_TSMC_2020_2964032
crossref_primary_10_1016_j_cja_2019_04_025
crossref_primary_10_1080_17445760_2021_1991340
crossref_primary_10_1109_TSMC_2018_2852724
crossref_primary_10_1109_TASE_2024_3414843
crossref_primary_10_1109_TSMC_2024_3473851
crossref_primary_10_1109_TASE_2021_3061140
crossref_primary_10_1016_j_cor_2024_106912
crossref_primary_10_1109_JIOT_2018_2871346
crossref_primary_10_1109_TASE_2020_3009984
crossref_primary_10_1109_TSMC_2020_2978486
crossref_primary_10_1016_j_isatra_2018_11_025
crossref_primary_10_1080_00207543_2021_1926568
crossref_primary_10_1109_ACCESS_2019_2897753
crossref_primary_10_1109_TASE_2016_2642997
crossref_primary_10_3390_app12157519
crossref_primary_10_1109_ACCESS_2021_3077503
crossref_primary_10_1109_TASE_2021_3122576
crossref_primary_10_1109_TASE_2018_2868004
crossref_primary_10_1109_ACCESS_2019_2936052
crossref_primary_10_1109_TSMC_2019_2894778
crossref_primary_10_1109_ACCESS_2019_2952056
crossref_primary_10_1080_24725854_2018_1555727
crossref_primary_10_1109_ACCESS_2021_3069888
crossref_primary_10_1109_TSM_2020_2998734
crossref_primary_10_1109_ACCESS_2019_2896254
crossref_primary_10_1145_3570326
crossref_primary_10_1080_0951192X_2020_1718767
crossref_primary_10_1155_2021_6598782
crossref_primary_10_1109_JAS_2020_1003207
crossref_primary_10_1109_TSMC_2024_3409727
crossref_primary_10_1109_TSMC_2017_2721979
crossref_primary_10_1109_JAS_2023_123327
crossref_primary_10_1109_TSMC_2019_2899590
crossref_primary_10_1016_j_ins_2019_01_029
crossref_primary_10_1109_ACCESS_2019_2942851
crossref_primary_10_1109_TASE_2018_2862380
Cites_doi 10.1109/TSMCA.2007.909542
10.1109/21.44011
10.1109/TSM.2012.2199338
10.1109/TASE.2005.851236
10.1080/00207543.2011.590949
10.1109/66.705370
10.1109/TASE.2008.2008633
10.1109/TASE.2015.2404937
10.1115/1.2905428
10.1109/TSMC.2014.2368995
10.1109/TSMC.2016.2531697
10.1109/TSM.2013.2281083
10.1109/TASE.2012.2192476
10.1007/978-1-4615-3126-5
10.1016/0005-1098(92)90061-J
10.1109/TASE.2014.2312823
10.1109/TSMCA.2012.2187890
10.1109/TSM.2014.2375880
10.1287/msom.4.4.296.5731
10.1109/TSMC.2015.2501232
10.1109/TSM.2014.2340858
10.1109/TII.2013.2272702
10.1109/TSM.2003.815203
10.1109/TSMC.2015.2507140
10.1109/TSM.2008.2000425
10.1109/TASE.2010.2046736
10.1109/5326.760564
10.1109/ACCESS.2016.2549546
10.1109/3477.484449
10.1109/TSM.2010.2051731
10.1109/WSC.2008.4736340
10.1109/ICRA.2013.6631075
10.1109/TASE.2012.2217128
10.1109/5.775417
10.1109/MRA.2015.2415047
10.1109/ICMA.2012.6284370
10.1109/TASE.2015.2404921
10.1109/TSM.2012.2222945
10.1109/70.143353
10.1109/70.86081
10.1109/CoASE.2013.6653939
10.1109/TSM.2004.831948
10.1109/TSM.2013.2278378
10.1109/TASE.2013.2293552
10.1007/978-1-4615-2231-7
10.1109/TASE.2011.2178023
10.1109/WSC.2003.1261581
10.1007/978-3-642-13520-0_12
10.1109/TASE.2011.2160452
10.1109/TSMC.2014.2347928
10.1109/TASE.2014.2332258
10.1016/j.cor.2014.03.024
10.1007/s10951-015-0448-7
10.1109/TASE.2012.2220355
10.1109/41.334574
10.1002/9781119036821
10.1109/TSM.2005.852103
10.1002/rob.4620120303
10.1109/TASE.2013.2296855
10.1109/TASE.2013.2292572
10.1080/17517575.2014.948936
10.1109/TSM.2011.2180547
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1109/TSMC.2016.2598303
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Aerospace Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2168-2232
EndPage 400
ExternalDocumentID 10_1109_TSMC_2016_2598303
7572224
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61673123; 61273036; U1401240
  funderid: 10.13039/501100001809
– fundername: Natural Science Foundation of Guangdong Province, China
  grantid: 2014A030310118; 2016A030313702
  funderid: 10.13039/501100003453
– fundername: U.S. Natural Science Foundation
  grantid: CMMI-1162482
  funderid: 10.13039/100000001
– fundername: Science and Technology Development Fund (FDCT) of Macau
  grantid: 065/2013/A2; 102/2013/A
GroupedDBID 0R~
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
ACIWK
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
RIG
7SC
7SP
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c293t-da92465e662582cb100320c71c036821e9c3bde1fff9d275485e96c040e7b8033
IEDL.DBID RIE
ISSN 2168-2216
IngestDate Mon Jun 30 05:09:29 EDT 2025
Tue Jul 01 02:29:05 EDT 2025
Thu Apr 24 22:52:04 EDT 2025
Wed Aug 27 02:52:40 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-da92465e662582cb100320c71c036821e9c3bde1fff9d275485e96c040e7b8033
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-5408-8752
PQID 2002496057
PQPubID 75739
PageCount 12
ParticipantIDs ieee_primary_7572224
proquest_journals_2002496057
crossref_primary_10_1109_TSMC_2016_2598303
crossref_citationtrail_10_1109_TSMC_2016_2598303
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2018-03-01
PublicationDateYYYYMMDD 2018-03-01
PublicationDate_xml – month: 03
  year: 2018
  text: 2018-03-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on systems, man, and cybernetics. Systems
PublicationTitleAbbrev TSMC
PublicationYear 2018
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref57
ref13
ref56
ref12
ref59
ref15
zhu (ref67) 2015; 28
ref58
ref14
ref53
ref52
ref55
ref11
ref54
ref10
ref17
ref16
ref19
ref18
wu (ref45) 2013; 43
ref51
ref50
ref48
ref47
montgomery (ref23) 2000; 8
wu (ref46) 2010; 7
ref42
cormen (ref3) 2001
ref41
ref44
ref43
ref49
ref8
ref7
pan (ref25) 2015; 45
ref9
ref4
ref5
ref40
ref35
ref34
ref36
ref31
ref30
ref33
ref32
ref2
ref39
zurawski (ref70) 1996
lee (ref20) 2004
ref68
ref24
ref26
ref69
ref64
ref63
ref66
ref22
ref65
ref21
ahn (ref1) 2010
ref28
wu (ref38) 2009
ref27
ref29
handy (ref6) 2014
ref60
ref62
wu (ref37) 1999; 29
ref61
zurawski (ref71) 1994; 41
References_xml – ident: ref39
  doi: 10.1109/TSMCA.2007.909542
– ident: ref57
  doi: 10.1109/21.44011
– ident: ref32
  doi: 10.1109/TSM.2012.2199338
– ident: ref21
  doi: 10.1109/TASE.2005.851236
– ident: ref10
  doi: 10.1080/00207543.2011.590949
– ident: ref62
  doi: 10.1109/66.705370
– volume: 7
  start-page: 303
  year: 2010
  ident: ref46
  article-title: A closed-form solution for schedulability and optimal scheduling of dual-arm cluster tools with wafer residency time constraint based on steady schedule analysis
  publication-title: IEEE Trans Autom Sci Eng
  doi: 10.1109/TASE.2008.2008633
– ident: ref36
  doi: 10.1109/TASE.2015.2404937
– ident: ref63
  doi: 10.1115/1.2905428
– volume: 8
  start-page: 63
  year: 2000
  ident: ref23
  article-title: Higher profits from intelligent semiconductor-equipment maintenance: 'The source of maintenance problem'
  publication-title: Future Fab Int
– volume: 45
  start-page: 805
  year: 2015
  ident: ref25
  article-title: A novel algorithm for wafer sojourn time analysis of single-arm cluster tools with wafer residency time constraints and activity time variation
  publication-title: IEEE Trans Syst Man Cybern Syst
  doi: 10.1109/TSMC.2014.2368995
– ident: ref51
  doi: 10.1109/TSMC.2016.2531697
– ident: ref18
  doi: 10.1109/TSM.2013.2281083
– ident: ref33
  doi: 10.1109/TASE.2012.2192476
– ident: ref56
  doi: 10.1007/978-1-4615-3126-5
– ident: ref60
  doi: 10.1016/0005-1098(92)90061-J
– ident: ref26
  doi: 10.1109/TASE.2014.2312823
– ident: ref44
  doi: 10.1109/TSMCA.2012.2187890
– volume: 28
  start-page: 117
  year: 2015
  ident: ref67
  article-title: Scheduling of single-arm multi-cluster tools with wafer residency time constraints in semiconductor manufacturing
  publication-title: IEEE Trans Semicond Manuf
  doi: 10.1109/TSM.2014.2375880
– ident: ref5
  doi: 10.1287/msom.4.4.296.5731
– ident: ref2
  doi: 10.1109/TSMC.2015.2501232
– ident: ref29
  doi: 10.1109/TSM.2014.2340858
– ident: ref30
  doi: 10.1109/TII.2013.2272702
– ident: ref12
  doi: 10.1109/TSM.2003.815203
– ident: ref50
  doi: 10.1109/TSMC.2015.2507140
– start-page: 39
  year: 2010
  ident: ref1
  article-title: Analysis of circular cluster tools: Transient behavior and semiconductor equipment models
  publication-title: Proc IEEE Int Conf Autom Sci Eng
– year: 2001
  ident: ref3
  publication-title: Introduction to Algorithms
– ident: ref42
  doi: 10.1109/TSM.2008.2000425
– ident: ref43
  doi: 10.1109/TASE.2010.2046736
– volume: 29
  start-page: 192
  year: 1999
  ident: ref37
  article-title: Necessary and sufficient conditions for deadlock-free operation in flexible manufacturing systems using a colored Petri net model
  publication-title: IEEE Trans Syst Man Cybern C Appl Rev
  doi: 10.1109/5326.760564
– ident: ref68
  doi: 10.1109/ACCESS.2016.2549546
– ident: ref61
  doi: 10.1109/3477.484449
– ident: ref34
  doi: 10.1109/TSM.2010.2051731
– ident: ref7
  doi: 10.1109/WSC.2008.4736340
– ident: ref65
  doi: 10.1109/ICRA.2013.6631075
– ident: ref49
  doi: 10.1109/TASE.2012.2217128
– ident: ref16
  doi: 10.1109/5.775417
– year: 2009
  ident: ref38
  publication-title: System Modeling and Control with Resource-Oriented Petri Nets
– start-page: 1
  year: 2004
  ident: ref20
  article-title: Workload balancing and scheduling of a single-armed cluster tool
  publication-title: Proc 5th APIEMS Conf
– ident: ref40
  doi: 10.1109/MRA.2015.2415047
– ident: ref17
  doi: 10.1109/ICMA.2012.6284370
– ident: ref9
  doi: 10.1109/TASE.2015.2404921
– ident: ref31
  doi: 10.1109/TSM.2012.2222945
– ident: ref59
  doi: 10.1109/70.143353
– ident: ref58
  doi: 10.1109/70.86081
– ident: ref11
  doi: 10.1109/CoASE.2013.6653939
– ident: ref52
  doi: 10.1109/TSM.2004.831948
– volume: 43
  start-page: 1182
  year: 2013
  ident: ref45
  article-title: A Petri-net-based scheduling strategy for dual-arm cluster tools with wafer revisiting
  publication-title: IEEE Trans Syst Man Cybern Syst
  doi: 10.1109/TSMCA.2012.2187890
– ident: ref66
  doi: 10.1109/TSM.2013.2278378
– ident: ref14
  doi: 10.1109/TASE.2013.2293552
– ident: ref54
  doi: 10.1007/978-1-4615-2231-7
– ident: ref47
  doi: 10.1109/TASE.2011.2178023
– ident: ref35
  doi: 10.1109/WSC.2003.1261581
– ident: ref4
  doi: 10.1007/978-3-642-13520-0_12
– ident: ref48
  doi: 10.1109/TASE.2011.2160452
– start-page: 669
  year: 1996
  ident: ref70
  article-title: Functional and behavioral modeling of automated manufacturing systems
  publication-title: Handbook of Industrial Electronic Engineering
– ident: ref27
  doi: 10.1109/TSMC.2014.2347928
– volume: 41
  start-page: 565
  year: 1994
  ident: ref71
  article-title: Guest editorial: Special section on Petri nets in manufacturing
  publication-title: IEEE Trans Ind Electron
– ident: ref15
  doi: 10.1109/TASE.2014.2332258
– ident: ref28
  doi: 10.1016/j.cor.2014.03.024
– ident: ref22
  doi: 10.1007/s10951-015-0448-7
– ident: ref13
  doi: 10.1109/TASE.2012.2220355
– ident: ref69
  doi: 10.1109/41.334574
– ident: ref64
  doi: 10.1002/9781119036821
– ident: ref53
  doi: 10.1109/TSM.2005.852103
– ident: ref55
  doi: 10.1002/rob.4620120303
– ident: ref19
  doi: 10.1109/TASE.2013.2296855
– ident: ref24
  doi: 10.1109/TASE.2013.2292572
– ident: ref41
  doi: 10.1080/17517575.2014.948936
– year: 2014
  ident: ref6
  publication-title: Why Are Computer Chips so Expensive?
– ident: ref8
  doi: 10.1109/TSM.2011.2180547
SSID ssj0001286306
Score 2.3933437
Snippet In wafer fabrication, a robotic cluster tool is required to be closed down in order for engineers to perform its on-demand and preventive maintenance and...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 389
SubjectTerms Batch processing
Cluster tool
Clusters
discrete event systems
Optimal scheduling
Optimization
Petri net (PN)
Preventive maintenance
robotic systems
Robots
Schedules
scheduling
Semiconductor device modeling
Steady-state
Time factors
Transient analysis
wafer fabrication
Title Petri Net Modeling and Scheduling of a Close-Down Process for Time-Constrained Single-Arm Cluster Tools
URI https://ieeexplore.ieee.org/document/7572224
https://www.proquest.com/docview/2002496057
Volume 48
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwED6VTjDwRpSXPDAhXPJo7HhEhapCape2EltUOxcGqgbRZOHXc3bcCgFCLFES-SJLn-PzZ9_dB3AdJ-Q4CiV5Ps8T3kNpuFap5kZqcvCm0Im2-x2jsRjOek_PyXMLbje5MIjogs-wa2_dWX5emtpuld3JRJI7623BFhG3Jlfry35KKmInpRmFgsCnqz_EDAN1N52M-jaOS3RpuZ_Ga4ks74acrsqPydh5mMEejNZ9awJLXrt1pbvm41vZxv92fh92_VKT3Tdj4wBauDyEnS8FCI_gxQlqsTFWzIqi2dR0Nl_mbEJQ5rV7LAs2Z_1FuUL-QIyd-cwCRotdZvNHuJX8dEITSHZksUBOo4dMaluDgU3LcrE6htngcdofci-9wA35_4qQI14mEhREj9LI6DCwQutGhoY8XhqFqEyscwyLolB5JIn2JKiEoRkBpU6DOD6B9rJc4ikw1Dm9jrUOiLpoFaRGFUmoYyNUJNVcdCBYI5EZX5fc9nqROX4SqMyCl1nwMg9eB242Jm9NUY6_Gh9ZMDYNPQ4duFjDnfnfdmU1OYmOEsOTZ79bncM2fTttgtAuoF2913hJq5JKX7nh-AmnU9we
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwzV3NTtwwEB4hOEAPpS2t2Ja2PrQXJC_5WdvxgQNaipaf3QuLxC1dOxMOrJKqmwi1z9JX4d0YO94VaqvekHqJksijOPFnz4wzMx_Ap1SQ4ii14sWsEHyAynKjM8OtMqTgbWmEcfsd44kcXQ3OrsX1Gvxa5cIgog8-w7479f_yi9q2bqvsQAlF6mwQQijP8ccdOWiLw9NjGs3PSXLyZToc8cAhwC0psoa6QA6GFCjJzs8Sa-LIMYZbFVtaurMkRm1TU2BclqUuEkX2u0AtLUEblckit91JC_wG2Rki6bLDHu3gZDL15J1JLAludAy_TeNIH0wvx0MXOSb75GBk6ZKUKyg-z-Tyx_LvddrJNtwvv0YXynLbbxvTtz9_KxT5v36uF_A8GNPsqEP_S1jD6hU8e1RicQduPGUYm2DDHO2bS75ns6pglwTWovWXdclmbDivF8iP67uKhdwJRuY8cxky3JGaeioNJDmSmCOn-UEirasywaZ1PV-8hqsnedM3sF7VFe4CQ1PQ7dSYiJwzo6PM6lLEJrVSJ0rPZA-i5cjnNlRed72e594Di3TuwJI7sOQBLD3YX4l868qO_Kvxjhv8VcMw7j3YW8IrDwvTwrGOksNNPqx6-3epj7A5mo4v8ovTyfk72KLnZF3I3R6sN99bfE82WGM--KnA4OtTg-kBW8Y3Dw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Petri+Net+Modeling+and+Scheduling+of+a+Close-Down+Process+for+Time-Constrained+Single-Arm+Cluster+Tools&rft.jtitle=IEEE+transactions+on+systems%2C+man%2C+and+cybernetics.+Systems&rft.au=Zhu%2C+QingHua&rft.au=Zhou%2C+MengChu&rft.au=Qiao%2C+Yan&rft.au=Wu%2C+NaiQi&rft.date=2018-03-01&rft.pub=IEEE&rft.issn=2168-2216&rft.volume=48&rft.issue=3&rft.spage=389&rft.epage=400&rft_id=info:doi/10.1109%2FTSMC.2016.2598303&rft.externalDocID=7572224
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2216&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2216&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2216&client=summon