A Pareto-based genetic algorithm for multi-objective scheduling of automated manufacturing systems

This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and flexibility of processing routes of jobs, and hence is prone to deadlock. Its scheduling problem includes both deadlock avoidance and performa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advances in mechanical engineering Ročník 12; číslo 1
Hlavní autoři: Zan, Xin, Wu, Zepeng, Guo, Cheng, Yu, Zhenhua
Médium: Journal Article
Jazyk:angličtina
Vydáno: London, England SAGE Publications 01.01.2020
Sage Publications Ltd
SAGE Publishing
Témata:
Automation
Classification
Feasibility
Genetic algorithms
Manufacturing
Multiple objective analysis
Optimization
Petri nets
Production scheduling
Scheduling
Sorting algorithms
genetic algorithm
scheduling
Automated manufacturing system
multi-objective optimization
Petri net
ISSN:1687-8132, 1687-8140
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and flexibility of processing routes of jobs, and hence is prone to deadlock. Its scheduling problem includes both deadlock avoidance and performance optimization. A new Pareto-based genetic algorithm is proposed to solve multi-objective scheduling problems of automated manufacturing systems. In automated manufacturing systems, scheduling not only sets up a routing for each job but also provides a feasible sequence of job operations. Possible solutions are expressed as individuals containing information of processing routes and the operation sequence of all jobs. The feasibility of individuals is checked by the Petri net model of an automated manufacturing system and its deadlock controller, and infeasible individuals are amended into feasible ones. The proposed algorithm has been tested with different instances and compared to the modified non-dominated sorting genetic algorithm II. The experiment results show the feasibility and effectiveness of the proposed algorithm.
AbstractList This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and flexibility of processing routes of jobs, and hence is prone to deadlock. Its scheduling problem includes both deadlock avoidance and performance optimization. A new Pareto-based genetic algorithm is proposed to solve multi-objective scheduling problems of automated manufacturing systems. In automated manufacturing systems, scheduling not only sets up a routing for each job but also provides a feasible sequence of job operations. Possible solutions are expressed as individuals containing information of processing routes and the operation sequence of all jobs. The feasibility of individuals is checked by the Petri net model of an automated manufacturing system and its deadlock controller, and infeasible individuals are amended into feasible ones. The proposed algorithm has been tested with different instances and compared to the modified non-dominated sorting genetic algorithm II. The experiment results show the feasibility and effectiveness of the proposed algorithm.
Author Guo, Cheng
Yu, Zhenhua
Wu, Zepeng
Zan, Xin
Author_xml – sequence: 1
  givenname: Xin
  surname: Zan
  fullname: Zan, Xin
– sequence: 2
  givenname: Zepeng
  surname: Wu
  fullname: Wu, Zepeng
– sequence: 3
  givenname: Cheng
  surname: Guo
  fullname: Guo, Cheng
– sequence: 4
  givenname: Zhenhua
  surname: Yu
  fullname: Yu, Zhenhua
  email: zhenhua_yu@163.com
BookMark eNp9kc1rHSEUxaWk0OQ1-y4Hsp5WHcfRZQhpEgi0i3YtV-c68TEzpuoU8t_H19cPCDQr5Xh-5x65Z-RkjSsS8oHRj4wNwycm1aCYoEwr1XMt3pDTg9QetJO_946_I-c5B0t7KimVWp8Se9l8hYQlthYyjs2EK5bgGpinmEJ5WBofU7NscwlttHt0JfzEJrsHHLc5rFMTfQNbiQuUSi-wbh5c2dLhKT_lgkt-T956mDOe_z535Pvn629Xt-39l5u7q8v71gk2lJZ5yxkyVEyNzKvOjl4MUo-995J7gVLKqlPhhRg7K7Ef7cC9osJyCtL23Y7cHXPHCHvzmMIC6clECOaXENNkINW_zWgqi2A5H2gdAnrQ6KkD4aV2ggOomnVxzHpM8ceGuZh93NJa6xve9ZT3mitRXfLocinmnNAbFwqUENeSIMyGUXNYj3m5ngrSF-Cfuq8g7RHJMOG_Nv_1PwM9Z6F8
CitedBy_id crossref_primary_10_1016_j_asoc_2022_108712
crossref_primary_10_1007_s12555_023_0796_6
crossref_primary_10_1109_TAI_2024_3444736
crossref_primary_10_3390_app11052186
crossref_primary_10_1109_ACCESS_2020_2977667
crossref_primary_10_1007_s40032_024_01160_x
crossref_primary_10_1016_j_imu_2022_101028
crossref_primary_10_1109_TSMC_2021_3056693
crossref_primary_10_3390_pr8030358
crossref_primary_10_1080_09537287_2023_2248947
crossref_primary_10_1109_ACCESS_2020_2991411
crossref_primary_10_1007_s40998_020_00343_3
crossref_primary_10_1109_ACCESS_2020_2983424
crossref_primary_10_1109_ACCESS_2020_2981760
crossref_primary_10_1016_j_focha_2023_100197
crossref_primary_10_1155_2024_9962745
crossref_primary_10_1109_ACCESS_2021_3073639
crossref_primary_10_3390_app10155270
crossref_primary_10_1109_ACCESS_2020_3014217
crossref_primary_10_1177_16878140211002691
crossref_primary_10_1109_ACCESS_2023_3266456
crossref_primary_10_1109_ACCESS_2020_3041408
crossref_primary_10_3390_su14031697
crossref_primary_10_1109_ACCESS_2020_3025836
crossref_primary_10_1109_ACCESS_2021_3102669
crossref_primary_10_1177_00202940211029337
crossref_primary_10_1109_ACCESS_2020_3021476
crossref_primary_10_1109_ACCESS_2020_3022643
crossref_primary_10_1109_ACCESS_2020_3004624
crossref_primary_10_1109_ACCESS_2021_3072331
crossref_primary_10_1109_JSEN_2021_3053099
crossref_primary_10_1016_j_ifacol_2022_10_100
crossref_primary_10_1080_10426914_2023_2236191
crossref_primary_10_1016_j_ijpe_2023_109077
crossref_primary_10_1016_j_lwt_2021_112861
crossref_primary_10_1109_ACCESS_2020_2970866
crossref_primary_10_1109_ACCESS_2020_2999074
crossref_primary_10_1007_s10853_025_10872_z
crossref_primary_10_1016_j_ins_2020_05_085
crossref_primary_10_3390_fractalfract5040176
crossref_primary_10_3390_su151914511
crossref_primary_10_1109_ACCESS_2020_3022694
crossref_primary_10_1109_ACCESS_2023_3259900
crossref_primary_10_1109_ACCESS_2020_2998132
crossref_primary_10_1016_j_jprocont_2021_07_012
crossref_primary_10_1109_TPDS_2025_3536357
crossref_primary_10_1109_ACCESS_2020_3015846
crossref_primary_10_1109_ACCESS_2020_3010237
crossref_primary_10_1177_1687814020975884
Cites_doi 10.1504/EJIE.2008.017685
10.1109/TASE.2006.888049
10.1016/j.cie.2010.07.014
10.1109/TSMCA.2003.820590
10.1109/TSMC.2018.2815618
10.1109/TAC.2016.2585647
10.1504/IJOR.2010.032422
10.1016/j.ijpe.2010.08.004
10.1109/70.370500
10.1016/j.ins.2013.01.003
10.1109/TSMCA.2003.820576
10.1162/evco.1994.2.3.221
10.1109/9.633824
10.1109/ACCESS.2018.2872572
10.1080/00207540412331330101
10.1007/s00170-012-4051-1
10.1007/s00170-012-4701-3
10.1016/j.ins.2014.07.039
10.1016/j.eswa.2009.09.005
10.1109/TSMC.2014.2351375
10.1109/4235.996017
10.1109/TAC.2016.2574120
10.1016/j.apm.2017.11.018
10.1007/s00291-005-0008-1
10.1287/moor.1.2.117
10.1109/TSMCB.2011.2170678
10.1080/00207543.2013.849012
10.1109/TSMC.2014.2376471
10.1109/TSMCC.2002.1009117
10.1109/70.499821
10.1109/TSMCA.2008.2007947
10.1007/s00170-014-5753-3
10.1109/TASE.2004.829440
10.1109/TAC.2015.2496500
10.1016/j.eswa.2009.02.080
10.1109/ACCESS.2019.2897753
10.1109/TASE.2018.2886303
10.1109/TSMCC.2011.2160626
10.1109/TSMCA.2008.2003535
ContentType Journal Article
Copyright The Author(s) 2020
The Author(s) 2020. This work is licensed under the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2020
– notice: The Author(s) 2020. This work is licensed under the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AFRWT
AAYXX
CITATION
7TB
8FD
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
H8D
HCIFZ
L6V
L7M
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOA
DOI 10.1177/1687814019885294
DatabaseName Sage Journals GOLD Open Access 2024
CrossRef
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
Engineering Research Database
Aerospace Database
SciTech Collection (ProQuest)
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
Aerospace Database
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database


CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1687-8140
ExternalDocumentID oai_doaj_org_article_5dbeab2270df4a979ef0ca4f69c42aa8
10_1177_1687814019885294
10.1177_1687814019885294
GrantInformation_xml – fundername: Key Research and Development Program of Shaanxi Province
  grantid: 2019GY-056
– fundername: National Natural Science Foundation of China
  grantid: 61573269, 61873277, 71571190
  funderid: https://doi.org/10.13039/501100001809
GroupedDBID .DC
0R~
188
23M
2UF
2WC
4.4
54M
5GY
5VS
8FE
8FG
8R4
8R5
AAJPV
AASGM
ABAWP
ABJCF
ABQXT
ACGFS
ACIWK
ACROE
ADBBV
ADOGD
AEDFJ
AENEX
AEUHG
AEWDL
AFCOW
AFKRA
AFKRG
AFRWT
AINHJ
AJUZI
ALMA_UNASSIGNED_HOLDINGS
AUTPY
AYAKG
BCNDV
BDDNI
BENPR
BGLVJ
C1A
CAHYU
CCPQU
CNMHZ
E3Z
EBS
EJD
GROUPED_DOAJ
H13
HCIFZ
IAO
IEA
IL9
ITC
J8X
K.F
KQ8
L6V
M7S
O9-
OK1
PHGZM
PHGZT
PIMPY
PTHSS
Q2X
RHU
ROL
SAUOL
SCDPB
SCNPE
SFC
TR2
UGNYK
AAYXX
ACHEB
AFFHD
CITATION
PQGLB
7TB
8FD
ABUWG
AZQEC
DWQXO
FR3
H8D
L7M
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c417t-1fb21e1e818d1f83bdf4769d5ff62f4e666d1f04f44d3b6e5db72f804b20a6b53
IEDL.DBID M7S
ISICitedReferencesCount 53
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000506013300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1687-8132
IngestDate Mon Nov 10 04:34:14 EST 2025
Fri Jul 25 12:28:18 EDT 2025
Sat Nov 29 08:09:03 EST 2025
Tue Nov 18 22:10:25 EST 2025
Tue Jun 17 22:42:46 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords genetic algorithm
scheduling
Automated manufacturing system
multi-objective optimization
Petri net
Language English
License This article is distributed under the terms of the Creative Commons Attribution 4.0 License (http://creativecommons.org/licenses/by/4.0/) which permits any use, reproduction and distribution of the work without further permission provided the original work is attributed as specified on the SAGE and Open Access pages (https://us.sagepub.com/en-us/nam/open-access-at-sage).
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c417t-1fb21e1e818d1f83bdf4769d5ff62f4e666d1f04f44d3b6e5db72f804b20a6b53
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2350259284?pq-origsite=%requestingapplication%
PQID 2350259284
PQPubID 237349
ParticipantIDs doaj_primary_oai_doaj_org_article_5dbeab2270df4a979ef0ca4f69c42aa8
proquest_journals_2350259284
crossref_citationtrail_10_1177_1687814019885294
crossref_primary_10_1177_1687814019885294
sage_journals_10_1177_1687814019885294
PublicationCentury 2000
PublicationDate 20200100
2020-01-00
20200101
2020-01-01
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 1
  year: 2020
  text: 20200100
PublicationDecade 2020
PublicationPlace London, England
PublicationPlace_xml – name: London, England
– name: New York
PublicationTitle Advances in mechanical engineering
PublicationYear 2020
Publisher SAGE Publications
Sage Publications Ltd
SAGE Publishing
Publisher_xml – name: SAGE Publications
– name: Sage Publications Ltd
– name: SAGE Publishing
References Ezpeleta, Colom, Martinez 1995; 11
Li, Liu, Li 2019; 7
Fahmy, ElMekkawy, Balakrishnan 2008; 2
Xing, Zhou, Liu 2009; 39
Liu, Li, Li 2019; 49
Baruwa, Piera, Guasch 2015; 45
Li, Pan, Liang 2010; 59
Karthikeyan, Asokan, Nickolas 2014; 72
Fahmy, ElMekkawy, Balakrishnan 2010; 7
Reveliotis, Lawley, Ferreira 1997; 42
Karimi, Zandieh, Karamooz 2010; 37
Deb, Sameer Agarwal, Meyarivan 2002; 6
Luo, Xing, Zhou 2015; 45
Gomes, Barbosa-Povoa, Novais 2005; 43
Moslehi, Mahnam 2011; 129
Ramaswamy, Joshi 1996; 12
Ma, Tong, Li 2017; 62
Piroddi, Cordone, Fumagalli 2008; 38
Shao, Pi, Shao 2019; 16
Behnamian, Fatemi, Zandieh 2009; 36
Ma, Li, Giua 2017; 62
Srinivas, Deb 1994; 2
Li, Zhou 2004; 34
Han, Xing, Chen 2013; 52
Rahmati, Zandieh, Yazdani 2013; 64
Brucker, Heitmann, Hurink 2006; 28
Xing, Han, Zhou 2012; 42
Kacem, Hammadi, Borne 2002; 32
Toba 2005; 2
Wang, Xing, Li 2018; 55
Gu, Li, Wu 2018; 6
Wu, Zhou 2007; 4
Li, Wu, Zhou 2012; 42
Shao, Liu, Liu 2013; 67
Liu, Li, Barkaoui 2013; 235
Gao, Suganthan, Pan 2014; 289
Garey, Johnson, Sethi 1976; 1
Fanti, Zhou 2004; 34
Tong, Li, Giua 2016; 61
bibr27-1687814019885294
bibr19-1687814019885294
bibr5-1687814019885294
bibr14-1687814019885294
bibr30-1687814019885294
bibr23-1687814019885294
bibr21-1687814019885294
bibr36-1687814019885294
bibr39-1687814019885294
bibr34-1687814019885294
bibr40-1687814019885294
bibr26-1687814019885294
bibr4-1687814019885294
bibr10-1687814019885294
bibr13-1687814019885294
bibr9-1687814019885294
bibr18-1687814019885294
bibr31-1687814019885294
bibr35-1687814019885294
bibr22-1687814019885294
Heitmann S (bibr11-1687814019885294) 2007
bibr3-1687814019885294
bibr33-1687814019885294
bibr8-1687814019885294
bibr16-1687814019885294
Pinedo ML (bibr1-1687814019885294) 2008
bibr29-1687814019885294
bibr12-1687814019885294
bibr17-1687814019885294
bibr25-1687814019885294
bibr32-1687814019885294
Deb K (bibr41-1687814019885294) 2001
bibr38-1687814019885294
bibr28-1687814019885294
bibr7-1687814019885294
bibr15-1687814019885294
bibr42-1687814019885294
bibr24-1687814019885294
bibr6-1687814019885294
bibr20-1687814019885294
bibr2-1687814019885294
bibr37-1687814019885294
References_xml – volume: 62
  start-page: 1329
  year: 2017
  end-page: 1341
  article-title: Characterization of admissible marking sets in Petri nets with conflicts and synchronizations
  publication-title: IEEE T Automat Contr
– volume: 32
  start-page: 1
  year: 2002
  end-page: 13
  article-title: Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems
  publication-title: IEEE Syst Man Cybern
– volume: 49
  start-page: 1371
  year: 2019
  end-page: 1385
  article-title: Robust deadlock control for automated manufacturing systems with unreliable resources based on Petri net reachability graphs
  publication-title: IEEE T Syst Man Cy S
– volume: 62
  start-page: 1078
  year: 2017
  end-page: 1093
  article-title: Basis marking representation of Petri net reachability spaces and its application to the reachability problem
  publication-title: IEEE T Automat Contr
– volume: 38
  start-page: 1337
  year: 2008
  end-page: 1348
  article-title: Selective siphon control for deadlock prevention in Petri nets
  publication-title: IEEE T Syst Man Cy A
– volume: 16
  start-page: 1344
  year: 2019
  end-page: 1360
  article-title: A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time
  publication-title: IEEE T Autom Sci Eng
– volume: 55
  start-page: 776
  year: 2018
  end-page: 788
  article-title: An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets
  publication-title: Appl Math Model
– volume: 289
  start-page: 76
  year: 2014
  end-page: 90
  article-title: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
  publication-title: Inform Sciences
– volume: 67
  start-page: 2885
  year: 2013
  end-page: 2901
  article-title: Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem
  publication-title: Int J Adv Manuf Technol
– volume: 36
  start-page: 11057
  year: 2009
  end-page: 11069
  article-title: A multi-phase covering Pareto optimal front method to multi-objective scheduling in a realistic hybrid flow shop using a hybrid metaheuristic
  publication-title: Expert Syst Appl
– volume: 28
  start-page: 151
  year: 2006
  end-page: 176
  article-title: Job-shop scheduling with limited capacity buffers
  publication-title: OR Spectrum
– volume: 6
  start-page: 182
  year: 2002
  end-page: 197
  article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II
  publication-title: IEEE T Evol Comput
– volume: 42
  start-page: 437
  year: 2012
  end-page: 462
  article-title: Deadlock control of automated manufacturing systems based on Petri nets: a literature review
  publication-title: IEEE T Syst Man Cy C
– volume: 129
  start-page: 14
  year: 2011
  end-page: 22
  article-title: A Pareto approach to multiobjective flexible job-shop scheduling problem using particle swarm optimization and local search
  publication-title: Int J Prod Econ
– volume: 64
  start-page: 915
  year: 2013
  end-page: 932
  article-title: Developing two multiobjective evolutionary algorithms for the multi-objective flexible job shop scheduling problem
  publication-title: Int J Adv Manuf Technol
– volume: 43
  start-page: 2323
  year: 2005
  end-page: 2353
  article-title: Optimal scheduling for flexible job shop operation
  publication-title: Int J Prod Res
– volume: 34
  start-page: 38
  year: 2004
  end-page: 51
  article-title: Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems
  publication-title: IEEE T Syst Man Cy As
– volume: 2
  start-page: 221
  year: 1994
  end-page: 248
  article-title: Multiobjective optimization using nondominated sorting in genetic algorithms
  publication-title: Evol Comput
– volume: 42
  start-page: 1344
  year: 1997
  end-page: 1357
  article-title: Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
  publication-title: IEEE T Automat Contr
– volume: 59
  start-page: 647
  year: 2010
  end-page: 662
  article-title: An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
  publication-title: Comput Ind Eng
– volume: 45
  start-page: 831
  year: 2015
  end-page: 846
  article-title: Deadlock-free scheduling method for flexible manufacturing systems based on timed colored Petri nets and anytime heuristic search
  publication-title: IEEE Trans Syst Man Cybern: Syst
– volume: 42
  start-page: 603
  year: 2012
  end-page: 615
  article-title: Deadlock-free genetic scheduling for automated manufacturing systems based on deadlock control policy
  publication-title: IEEE T Syst Man Cy B
– volume: 7
  start-page: 21006
  year: 2019
  end-page: 21019
  article-title: Elementary siphon-based robust control for automated manufacturing systems with multiple unreliable resources
  publication-title: IEEE Access
– volume: 34
  start-page: 5
  year: 2004
  end-page: 22
  article-title: Deadlock control methods in automated manufacturing systems
  publication-title: IEEE Systs Man Cybern A Systs Humans
– volume: 6
  start-page: 68824
  year: 2018
  end-page: 68838
  article-title: Improved multi-step look-ahead control policies for automated manufacturing systems
  publication-title: IEEE Access
– volume: 7
  start-page: 463
  year: 2010
  end-page: 486
  article-title: Mathematical formulations for scheduling in manufacturing cells with limited capacity buffers
  publication-title: Int J Oper Res
– volume: 37
  start-page: 4024
  year: 2010
  end-page: 4032
  article-title: Bi-objective group scheduling in hybrid flexible flow shop: a multi-phase approach
  publication-title: Expert Syst Appl
– volume: 2
  start-page: 231
  year: 2008
  end-page: 252
  article-title: Deadlock-free scheduling of flexible job shops with limited capacity buffers
  publication-title: Eur J Ind Eng
– volume: 4
  start-page: 474
  year: 2007
  end-page: 480
  article-title: Deadlock resolution in automated manufacturing systems with robots
  publication-title: IEEE T Autom Sci Eng
– volume: 235
  start-page: 259
  year: 2013
  end-page: 279
  article-title: Robustness of deadlock control for a class of Petri nets with unreliable resources
  publication-title: Inform Sci
– volume: 52
  start-page: 1557
  year: 2013
  end-page: 1572
  article-title: Deadlock-free genetic scheduling for flexible manufacturing systems using Petri nets and deadlock controllers
  publication-title: Int J Prod Res
– volume: 45
  start-page: 530
  year: 2015
  end-page: 541
  article-title: Deadlock-free scheduling of automated manufacturing systems using Petri nets and hybrid heuristic search
  publication-title: IEEE T Syst Man Cyb
– volume: 72
  start-page: 1567
  year: 2014
  end-page: 1579
  article-title: A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints
  publication-title: Int J Adv Manuf Technol
– volume: 1
  start-page: 117
  year: 1976
  end-page: 129
  article-title: The complexity of flow shop and job shop scheduling
  publication-title: Math Oper Res
– volume: 12
  start-page: 391
  year: 1996
  end-page: 400
  article-title: Deadlock-free schedules for automated manufacturing workstations
  publication-title: IEEE T Robot Autom
– volume: 2
  start-page: 78
  year: 2005
  end-page: 83
  article-title: A tight flow control for job-shop fabrication lines with finite buffers
  publication-title: IEEE T Autom Sci Eng
– volume: 11
  start-page: 173
  year: 1995
  end-page: 184
  article-title: A Petri net-based deadlock prevention policy for flexible manufacturing system
  publication-title: IEEE T Robot Autom
– volume: 61
  start-page: 2448
  year: 2016
  end-page: 2462
  article-title: On the equivalence of observation structures for Petri net generators
  publication-title: IEEE T Automat Contr
– volume: 39
  start-page: 188
  year: 2009
  end-page: 199
  article-title: Optimal Petri net based polynomial-complexity deadlock avoidance policies for automated manufacturing systems
  publication-title: IEEE T Syst Man Cy A
– ident: bibr12-1687814019885294
  doi: 10.1504/EJIE.2008.017685
– ident: bibr22-1687814019885294
  doi: 10.1109/TASE.2006.888049
– ident: bibr31-1687814019885294
  doi: 10.1016/j.cie.2010.07.014
– ident: bibr14-1687814019885294
  doi: 10.1109/TSMCA.2003.820590
– volume-title: Scheduling: theory, algorithms, and systems
  year: 2008
  ident: bibr1-1687814019885294
– volume-title: Job-shop scheduling with limited buffer capacities
  year: 2007
  ident: bibr11-1687814019885294
– ident: bibr3-1687814019885294
  doi: 10.1109/TSMC.2018.2815618
– ident: bibr16-1687814019885294
  doi: 10.1109/TAC.2016.2585647
– volume-title: Multi-objective optimization using evolutionary algorithms
  year: 2001
  ident: bibr41-1687814019885294
– ident: bibr13-1687814019885294
  doi: 10.1504/IJOR.2010.032422
– ident: bibr32-1687814019885294
  doi: 10.1016/j.ijpe.2010.08.004
– ident: bibr21-1687814019885294
  doi: 10.1109/70.370500
– ident: bibr6-1687814019885294
  doi: 10.1016/j.ins.2013.01.003
– ident: bibr23-1687814019885294
  doi: 10.1109/TSMCA.2003.820576
– ident: bibr40-1687814019885294
  doi: 10.1162/evco.1994.2.3.221
– ident: bibr19-1687814019885294
  doi: 10.1109/9.633824
– ident: bibr5-1687814019885294
  doi: 10.1109/ACCESS.2018.2872572
– ident: bibr8-1687814019885294
  doi: 10.1080/00207540412331330101
– ident: bibr33-1687814019885294
  doi: 10.1007/s00170-012-4051-1
– ident: bibr34-1687814019885294
  doi: 10.1007/s00170-012-4701-3
– ident: bibr35-1687814019885294
  doi: 10.1016/j.ins.2014.07.039
– ident: bibr39-1687814019885294
  doi: 10.1016/j.eswa.2009.09.005
– ident: bibr27-1687814019885294
  doi: 10.1109/TSMC.2014.2351375
– ident: bibr42-1687814019885294
  doi: 10.1109/4235.996017
– ident: bibr17-1687814019885294
  doi: 10.1109/TAC.2016.2574120
– ident: bibr28-1687814019885294
  doi: 10.1016/j.apm.2017.11.018
– ident: bibr10-1687814019885294
  doi: 10.1007/s00291-005-0008-1
– ident: bibr2-1687814019885294
  doi: 10.1287/moor.1.2.117
– ident: bibr25-1687814019885294
  doi: 10.1109/TSMCB.2011.2170678
– ident: bibr26-1687814019885294
  doi: 10.1080/00207543.2013.849012
– ident: bibr29-1687814019885294
  doi: 10.1109/TSMC.2014.2376471
– ident: bibr30-1687814019885294
  doi: 10.1109/TSMCC.2002.1009117
– ident: bibr7-1687814019885294
  doi: 10.1109/70.499821
– ident: bibr20-1687814019885294
  doi: 10.1109/TSMCA.2008.2007947
– ident: bibr36-1687814019885294
  doi: 10.1007/s00170-014-5753-3
– ident: bibr9-1687814019885294
  doi: 10.1109/TASE.2004.829440
– ident: bibr18-1687814019885294
  doi: 10.1109/TAC.2015.2496500
– ident: bibr38-1687814019885294
  doi: 10.1016/j.eswa.2009.02.080
– ident: bibr4-1687814019885294
  doi: 10.1109/ACCESS.2019.2897753
– ident: bibr37-1687814019885294
  doi: 10.1109/TASE.2018.2886303
– ident: bibr15-1687814019885294
  doi: 10.1109/TSMCC.2011.2160626
– ident: bibr24-1687814019885294
  doi: 10.1109/TSMCA.2008.2003535
SSID ssib050600699
ssj0000395696
ssib044728254
ssib023771143
Score 2.3877122
Snippet This work focuses on multi-objective scheduling problems of automated manufacturing systems. Such an automated manufacturing system has limited resources and...
SourceID doaj
proquest
crossref
sage
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
SubjectTerms Automation
Classification
Feasibility
Genetic algorithms
Manufacturing
Multiple objective analysis
Optimization
Petri nets
Production scheduling
Scheduling
Sorting algorithms
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQAD4ikKBXlASAxRbceJ47EgKqaqA0jdIju2eahtUB_8fs5OWlIkYGHJ4NiSdb74vi_2fYfQFQkgIysi5xIZeQ2pSKbwoIaklmc8FkaFYhNiMMhGIzlslPryd8IqeeDKcN3EaKs0Y4IYx5UU0jpSKO5SWXCmVEjzJUI2yFTYg2PA_bJxLtmlaRbUnYBkZwmTfCMOBbn-DYzZuNYVIk1_H-3VEBH3qqkdoC07PUS7DeHAI6R7eOjL05aRj0IGgxf4ZESsxs8lsP2XCQYsisNlwajUb9WmhoHIQmDx-ee4dFgtFyXAVRg9UdOlT3AIGYu40naeH6On_v3j3UNUV0uICk7FIqJOM2qphQhsqMtiDfYSqTSJcylz3AJPgXbCHecm1qkFwwrmMsI1IyrVSXyCWtNyak8R5gJgC08ocDELAMNmyhITG8mVIQVAvjbqrmyXF7WUuK9oMc5prR7-3dptdLMe8V7JaPzS99Yvx7qfF8AODeAWee0W-V9u0Uad1WLm9Vc5z1mcAMSTEJHb6Nov8NernyZz9h-TOUc7zNP08Oemg1qL2dJeoO3iY_E6n10Gz_0EIlnvRA
  priority: 102
  providerName: Directory of Open Access Journals
Title A Pareto-based genetic algorithm for multi-objective scheduling of automated manufacturing systems
URI https://journals.sagepub.com/doi/full/10.1177/1687814019885294
https://www.proquest.com/docview/2350259284
https://doaj.org/article/5dbeab2270df4a979ef0ca4f69c42aa8
Volume 12
WOSCitedRecordID wos000506013300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Directory of Open Access Journals
  customDbUrl:
  eissn: 1687-8140
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000395696
  issn: 1687-8132
  databaseCode: DOA
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1687-8140
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044728254
  issn: 1687-8132
  databaseCode: M~E
  dateStart: 20080101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1687-8140
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000395696
  issn: 1687-8132
  databaseCode: M7S
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central Database Suite (ProQuest)
  customDbUrl:
  eissn: 1687-8140
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000395696
  issn: 1687-8132
  databaseCode: BENPR
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1687-8140
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000395696
  issn: 1687-8132
  databaseCode: PIMPY
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELag5QAH3oiFsvIBIXGI1nYcP06oRa3gwCriIZVT5MR2C2o3ZTfL72fG630UiV645ODEVhyPZ76ZeL4h5DVLIMN0RYyVLZBDqrAKLtwzFaSRpfYuFZvQ06k5PbV1Drgt8rHKtU5Mitr3HcbIJ6KswDxb0Kbvrn4VWDUK_67mEhq3yT6yJPB0dO_LWp5EqTXfoa-TUmOm5kb-kFuPqQzHk-YuwVtIJb24gr1nwFPb_tmcYBvyQ4Gbbiph5TVLlgj_r6HUnYNhyVadPPjfWT4k9zNKpYcrsXpEboXZY3Jvh7vwCWkPaY0VcvsCDaGnIIiYD0ndxRkMOJxfUoDDNJ1XLPr250qvUvClwbZhCjztI3XLoQfEDL0v3WyJORYpaZKu6KUXT8m3k-Ov7z8UuWBD0Umuh4LHVvDAA4AAz6MpWx-lVtZXMSoRZQBXCdqZjFL6slWh8q0W0TDZCuZUW5XPyN6sn4XnhEoNyElWHNzBABgnGBeYL72VzrMOUOeITNYfv-kymzkW1bhoeCYw_3u5RuTtpsfVisnjhmePcD03zyEHd2ro52dN3tINvH1wrRCawTSd1TZE1jkZle2kcM6MyMF6jZusGBbNdoFH5A1KyPbWv17mxc3jvCR3BcYAUljogOwN82V4Re50v4cfi_mY7B8dT-vP4xRrGKftAW31x0_19z8LEwyp
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELaqggQcyrNiSwEfAIlDtLbjxPYBofKoWrWsKlGk3oIT2wuo3ZTdLIg_xW9kxkl2t0j01gOXHJyH4mQe39gz3xDyjEWQoaskhMwkyCGVmBwO3LHcSy1T5WxsNqFGI31yYo7WyO--FgbTKnubGA21qytcIx-KNAP3bMCavj7_nmDXKNxd7VtotGJx4H_9hJBt9mr_Hfzf50Lsvj9-u5d0XQWSSnLVJDyUgnvuwVM5HnRauiBVblwWQi6C9IDnYZzJIKVLy9xnrlQiaCZLwWxeYpcIMPnXAEYIE1MFP_byK1Kl-ApdnpQKK0MX8o5cfizv4H_0FClEJ7GFGM9B1zVEhsud1CGOIR8VN1pnwsgLnjM2GLiAilcS0aJv3L39v33VO2SjQ-F0p1Wbu2TNT-6RWyvcjPdJuUOPsANwnaCjdxQUDes9qT0dwwSaL2cU4D6N-ZhJXX5r_QadgQ44TO4f0zpQO29qiAjg7jM7mWMNSSwKpS199uwB-XQlk9wk65N64h8SKhUgQ5lxCHc9YDivrWcudUZaxypA1QMy7H92UXVs7dg05LTgHUH73-IxIC8Xd5y3TCWXXPsG5WdxHXKMx4F6Oi46k1XA23tbCqEYTNMaZXxglZUhN5UU1uoB2e5lqugM36xYCtSAvECJXJ7618tsXf6cp-TG3vGHw-Jwf3TwiNwUuN4Rl8C2yXoznfvH5Hr1o_k6mz6JykjJ56uW0z8vMWY9
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwEB6tugjBgTeisIAPgMQhauw4sX1AaGGpqBaqHEBaTsGJ7QLabZYmBfHX-HWM3aTtIrG3PXDJwXkoTr552TPfADyJg5Mhq8i5VEWeQypSGR6oiTPLJU-E0aHZhJhO5dGRynfgd18L49Mqe50YFLWpK79GPmJJiuZZoTYduS4tIj8Yvzz9HvkOUn6ntW-nsYLIof31E8O35sXkAP_1U8bGbz68fht1HQaiilPRRtSVjFpq0WoZ6mRSGsdFpkzqXMYct-jb43jMHecmKTObmlIwJ2Neslhnpe8Ygep_F11yzgawm0_e5596NLNECLpFnse58HWia_R7Zr8464KBYDcSjFVCQzGaoeRLjBM3-6ojP-bZqaiSMmWKn7Gjod3AGR95Ky0tWMrx9f_5G9-Aa51_TvZXAnUTduz8FlzdYm28DeU-yX1v4DryLoAhKIK-EpTo4xlOoP1yQjAQICFTM6rLbyuLQhqUDuPT_mekdkQv2xpjBbz7RM-XvroklIuSFbF2cwc-Xsgk78JgXs_tPSBcoM_IU4qBsEXvzkptY5MYxbWJK_S3hzDqf3xRdTzuvp3IcUE76va_oTKE5-s7TlccJudc-8pjaX2dZx8PA_ViVnTKrMC3t7pkTMQ4Ta2Esi6uNHeZqjjTWg5hr8dX0anEptiAawjPPDo3p_71MvfPf85juIzwLN5NpocP4ArzCyFhbWwPBu1iaR_CpepH-7VZPOokk8DniwbqH0RmcHM
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=A+Pareto-based+genetic+algorithm+for+multi-objective+scheduling+of+automated+manufacturing+systems&rft.jtitle=Advances+in+mechanical+engineering&rft.au=Zan%2C+Xin&rft.au=Wu%2C+Zepeng&rft.au=Guo%2C+Cheng&rft.au=Yu%2C+Zhenhua&rft.date=2020-01-01&rft.issn=1687-8132&rft.eissn=1687-8140&rft.volume=12&rft.issue=1&rft_id=info:doi/10.1177%2F1687814019885294&rft.externalDBID=n%2Fa&rft.externalDocID=10_1177_1687814019885294
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1687-8132&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1687-8132&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1687-8132&client=summon