Petri Nets based Deadlock-free Scheduling for Flexible Manufacturing Systems

Author

He, Y.L. ; Wang, G.N.

Author_Institution

Ind. & Inf. Syst. Eng. Dept., Ajou Univ., Suwon

fYear

2006

fDate

5-8 Dec. 2006

Firstpage

1

Lastpage

5

Abstract

An efficient search algorithm for scheduling flexible manufacturing systems modeled by timed Petri nets is presented in this paper. The algorithm is based on the application of the A* algorithm and combines the structure theory of Petri nets. The proposed heuristic function can guarantee the optimal deadlock-free schedule can be obtained by applying the algorithm. Structural analysis of Petri nets is used as an truncation technique for the proposed algorithm. The efficiency of the proposed method is illustrated using an example of FMS scheduling problem

Keywords

Petri nets; flexible manufacturing systems; scheduling; A* algorithm; deadlock-free scheduling; efficient search algorithm; flexible manufacturing systems; structure theory; timed Petri nets; Control systems; Flexible manufacturing systems; Information systems; Job shop scheduling; Manufacturing industries; Petri nets; Production; Scheduling algorithm; System recovery; Systems engineering and theory; Deadlock-free; Flexible manufacturing system; Petri nets; Scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Automation, Robotics and Vision, 2006. ICARCV '06. 9th International Conference on

Conference_Location

Singapore

Print_ISBN

1-4244-0341-3

Electronic_ISBN

1-4214-042-1

Type

conf

DOI

10.1109/ICARCV.2006.345377

Filename

4150200