TY - JOUR
T1 - Deadlock-Free Scheduling of Flexible Assembly Systems Based on Petri Nets and Local Search
AU - Luo, Jianchao
AU - Liu, Zhiqiang
AU - Zhou, Mengchu
AU - Xing, Keyi
N1 - Funding Information:
Manuscript received February 25, 2018; revised April 13, 2018; accepted June 28, 2018. Date of publication September 10, 2018; date of current version September 16, 2020. This work was supported in part by the Fundamental Research Funds for the Central Universities under Grant 3102017OQD110, in part by the Aviation Science Foundation of China under Grant 2015ZD53050, in part by the National Defense Basic Scientific Research Program under Grant N2016KD0003, and in part by the National Natural Science Foundation of China under Grant 61573278. This paper was recommended by Associate Editor M. K. Tiwari. (Corresponding authors: ZhiQiang Liu; MengChu Zhou.) J. Luo and Z. Liu are with the School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an 710072, China (e-mail: luojianchao@nwpu.edu.cn; zqliu@nwpu.edu.cn).
Publisher Copyright:
© 2013 IEEE.
PY - 2020/10
Y1 - 2020/10
N2 - Deadlock-free scheduling and control is critical for optimizing the performance of flexible assembly systems (FASs). Based on the Petri net models of FASs, this paper integrates a deadlock prevention policy with local search and develops a novel deadlock-free scheduling algorithm. A solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the deadlock prevention policy, a repairing algorithm (RA) is developed to repair unfeasible chromosomes. A perturbation strategy based on estimation of distribution algorithm is developed to escape from local optima. Moreover, to improve population diversity, an acceptance criterion (AC) based on Pareto dominance is proposed. The chromosome representation, RA, perturbation strategy, and AC together support the cooperative aspect of local search for scheduling problems strongly.
AB - Deadlock-free scheduling and control is critical for optimizing the performance of flexible assembly systems (FASs). Based on the Petri net models of FASs, this paper integrates a deadlock prevention policy with local search and develops a novel deadlock-free scheduling algorithm. A solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the deadlock prevention policy, a repairing algorithm (RA) is developed to repair unfeasible chromosomes. A perturbation strategy based on estimation of distribution algorithm is developed to escape from local optima. Moreover, to improve population diversity, an acceptance criterion (AC) based on Pareto dominance is proposed. The chromosome representation, RA, perturbation strategy, and AC together support the cooperative aspect of local search for scheduling problems strongly.
KW - Deadlock prevention policy
KW - Petri net (PN)
KW - flexible assembly system (FAS)
KW - local search
KW - scheduling
UR - http://www.scopus.com/inward/record.url?scp=85059111394&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059111394&partnerID=8YFLogxK
U2 - 10.1109/TSMC.2018.2855685
DO - 10.1109/TSMC.2018.2855685
M3 - Article
AN - SCOPUS:85059111394
SN - 2168-2216
VL - 50
SP - 3658
EP - 3669
JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems
JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems
IS - 10
M1 - 8457481
ER -