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

This source preferred by Hongnian Yu

This data was imported from Scopus:

Authors: Lloyd, S., Yu, H. and Konstas, N.

Journal: Proceedings of the IEEE International Symposium on Assembly and Task Planning

Pages: 141-146

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

The data on this page was last updated at 04:53 on March 24, 2019.