Title :
Petri net scheduling of FMS using branch and bound method
Author :
Zhou, MengChu ; Chiu, Hua-Sheng ; Xiong, H. Henry
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Abstract :
In this paper, Petri net models for flexible manufacturing systems (FMS) are constructed. A firing sequence of the Petri net from an initial marking to a final one can be seen as a schedule of the modeled FMS. By using the branch-and-bound algorithm, an optimal schedule of the FMS can be obtained. Timed marked graphs, a special class of timed Petri nets, are then used to analyze the long-term performance of the job-shop systems. For a job shop system, a procedure is proposed to derive the marked graph from the initial Petri net model after the schedule is determined. The branch and bound algorithm and proposed procedure are illustrated through a job-shop system
Keywords :
Petri nets; flexible manufacturing systems; production control; scheduling; FMS; Petri net models; Petri net scheduling; branch and bound method; firing sequence; flexible manufacturing systems; job-shop systems; long-term performance; optimal schedule; timed marked graphs; Algorithm design and analysis; Control system synthesis; Flexible manufacturing systems; Job shop scheduling; Manufacturing systems; Mathematical model; Optimal scheduling; Petri nets; Processor scheduling; Production;
Conference_Titel :
Industrial Electronics, Control, and Instrumentation, 1995., Proceedings of the 1995 IEEE IECON 21st International Conference on
Print_ISBN :
0-7803-3026-9
DOI :
10.1109/IECON.1995.483360
