Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

FMS scheduling using Petri net modeling and a branch & bound search

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)
Lloyd, S. ; Sch. of Eng., Sussex Univ., Brighton, UK ; Yu, H. ; Konstas, N.

An optimum scheduling algorithm for flexible manufacturing systems using Petri net modeling and modified branch and bound search is proposed in this paper. A Petri net modeling of the system is first discussed. Then the scheduling algorithm is developed using a modified branch and bound search. The method uses a Petri net model to generate and search a partial reachability graph, and presents an optimal makespan in terms of a firing sequence of transitions of the Petri net model of the system. A software package based an the Windows environment is described which produces a Petri net model satisfying the production requirement and this is used to obtain an optimum makespan through a modified branch and bound search. The results of several simulations are presented to demonstrate the validity of the proposed algorithm and show some improvement over previous work

Published in:

Assembly and Task Planning, 1995. Proceedings., IEEE International Symposium on

Date of Conference:

10-11 Aug 1995