DocumentCode
1737770
Title
Benchmarking an algorithm for Petri net scheduling
Author
Liljenvall, Torbjörn
Author_Institution
Control Eng. Lab., Chalmers Univ. of Technol., Goteborg, Sweden
Volume
4
fYear
2000
fDate
2000
Firstpage
3027
Abstract
This paper evaluates a Petri net algorithm for scheduling production systems. The examples presented are taken from the literature and could describe flexible manufacturing systems as well as multi-purpose batch plants. Production systems include a large variety of constraints that make the scheduling task difficult. The main reason for choosing Petri nets is the powerful modeling capacity. Different problem types are examined and the disadvantages and advantages with of a Petri net algorithm are discussed
Keywords
Petri nets; flexible manufacturing systems; production control; scheduling; Petri net algorithm; Petri net scheduling; algorithm benchmarking; event driven algorithm; flexible manufacturing systems; multi-purpose batch plant; production systems; Batch production systems; Control engineering; Flexible manufacturing systems; Job shop scheduling; Laboratories; Materials handling; Petri nets; Routing; Scheduling algorithm; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 2000 IEEE International Conference on
Conference_Location
Nashville, TN
ISSN
1062-922X
Print_ISBN
0-7803-6583-6
Type
conf
DOI
10.1109/ICSMC.2000.884462
Filename
884462
Link To Document