Petri net scheduling of FMS using branch and bound method

Mengchu Zhou, Hua Sheng Chiu, H. Henry Xiong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Scopus citations

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 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 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.

Original languageEnglish (US)
Title of host publicationIECON Proceedings (Industrial Electronics Conference)
PublisherIEEE
Pages211-216
Number of pages6
Volume1
StatePublished - Dec 1 1995
EventProceedings of the 1995 IEEE 21st International Conference on Industrial Electronics, Control, and Instrumentation. Part 1 (of 2) - Orlando, FL, USA
Duration: Nov 6 1995Nov 10 1995

Other

OtherProceedings of the 1995 IEEE 21st International Conference on Industrial Electronics, Control, and Instrumentation. Part 1 (of 2)
CityOrlando, FL, USA
Period11/6/9511/10/95

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Petri net scheduling of FMS using branch and bound method'. Together they form a unique fingerprint.

Cite this