A scalable deadlock avoidance algorithm for flexible manufacturing systems with free choice in part routing

Author

Judd, Robert P. ; Zhang, Wenle ; Deering, Paul ; Lipset, Robert

Author_Institution

Sch. of Electr. Eng .& Comput. Eng., Ohio Univ., Athens, OH, USA

Volume

5

fYear

2000

fDate

2000

Firstpage

3545

Abstract

A new deadlock avoidance algorithm for flexible manufacturing systems that contain both multiple capacity resources and free choice in part routing is presented. The method determines whether moving a part to its next step is safe, unsafe, or undetermined. This classification is linear in complexity. Part movements that are classified as undetermined are further analyzed using another procedure, which attempts to empty the system to determine whether the move is safe or not. It is polynomial in complexity. By adjusting a simple tuning parameter, the size of the set of possible undetermined classifications returned can be made arbitrarily small at the cost of increasing the order of the algorithm. An example showing the application of the method is provided

Keywords

computational complexity; flexible manufacturing systems; pattern classification; production control; resource allocation; FMS; complexity; deadlock avoidance; flexible manufacturing systems; multiple capacity resources; part routing; polynomial time; production control; Circuits; Computer science; Control systems; Costs; Flexible manufacturing systems; Manufacturing systems; Polynomials; Routing; Sufficient conditions; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2000. Proceedings of the 2000

Conference_Location

Chicago, IL

ISSN

0743-1619

Print_ISBN

0-7803-5519-9

Type

conf

DOI

10.1109/ACC.2000.879229

Filename

879229