Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy

Document Type

Article

Publication Date

1-1-2012

Abstract

Deadlock-free control and scheduling are vital for optimizing the performance of automated manufacturing systems (AMSs) with shared resources and route flexibility. Based on the Petri net models of AMSs, this paper embeds the optimal deadlock avoidance policy into the genetic algorithm and develops a novel deadlock-free genetic scheduling algorithm for AMSs. A possible solution of the scheduling problem is coded as a chromosome representation that is a permutation with repetition of parts. By using the one-step look-ahead method in the optimal deadlock control policy, the feasibility of a chromosome is checked, and infeasible chromosomes are amended into feasible ones, which can be easily decoded into a feasible deadlock-free schedule. The chromosome representation and polynomial complexity of checking and amending procedures together support the cooperative aspect of genetic search for scheduling problems strongly. © 2012 IEEE.

Identifier

84861189470 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics

External Full Text Location

https://doi.org/10.1109/TSMCB.2011.2170678

ISSN

10834419

PubMed ID

22106151

First Page

603

Last Page

615

Issue

3

Volume

42

Grant

50975224

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS