Deadlock-Free Scheduling of Flexible Assembly Systems Based on Petri Nets and Local Search

Document Type

Article

Publication Date

10-1-2020

Abstract

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.

Identifier

85059111394 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Systems

External Full Text Location

https://doi.org/10.1109/TSMC.2018.2855685

e-ISSN

21682232

ISSN

21682216

First Page

3658

Last Page

3669

Issue

10

Volume

50

Grant

2015ZD53050

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS