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

Authors:
Affiliations:
Venue:
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
Year:
1995

Citing 3
Cited 3

Truncation of Petri net models for simplifying computation of optimum scheduling problems

Computers in Industry
Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms

Mathematics and Computers in Simulation
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems

Integrating Petri nets and hybrid heuristic search for the scheduling of FMS

Computers in Industry
Combined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systems-part II: heuristic hybrid search

Computers and Industrial Engineering
Heuristic search for scheduling flexible manufacturing systems using lower bound reachability matrix

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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