By Topic

Petri net scheduling of FMS using branch and bound method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
MengChu Zhou ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Hua-Sheng Chiu ; Xiong, H.H.

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

Published in:

Industrial Electronics, Control, and Instrumentation, 1995., Proceedings of the 1995 IEEE IECON 21st International Conference on  (Volume:1 )

Date of Conference:

6-10 Nov 1995