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

Authors:
A. Reyes;H. Yu;G. Kelleher;S. Lloyd
Affiliations:
iSOCO Laboratory, Alcalde Barnils 64/68 A, 08190 Sant Cugat del Valles, Barcelona, Spain;School of Engineering and Computer Science, Exeter University, North Park Road, Exeter EX4 4QF, UK;CMS, Liverpool John Moores University, Byrom Street, Liverpool L3 3AF, UK;School of Engineering, Sussex University, Brighton BN1 9QT, UK
Venue:
Computers in Industry
Year:
2002

Citing 5
Cited 2

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
Heuristic search through islands

Artificial Intelligence
Petri nets and flexible manufacturing

Advances in Petri nets 1989
Animated AI-Based Simulation in Production Scheduling

KNOWHSEM '93 Proceedings of the IFIP TC5/WG5.3/IFAC International Working Conference on Knowledge Based Hybrid Systems in Engineering and Manufacturing
FMS scheduling using Petri net modeling and a branch & bound search

ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies modelling and scheduling of Flexible Manufacturing Systems (FMS) using Petri Nets (PNs) and Artificial Intelligence (AI) based on heuristic search methods. A subclass of PNs, Buffer nets or B-nets is obtained by the systematic synthesis of PN models from FMS formulations. Scheduling is performed as heuristic search in the reachability tree, which is guided by a new heuristic function that exploits PN information. This heuristic is derived from a new concept, the Resource Cost Reachability (RCR) matrix which builds on the properties of B-nets. To mitigate the complexity problem, a hybrid search algorithm is proposed. The algorithm combines dispatching rules based on analysis information provided by the PN simulation with a modified stage-search algorithm. Experimental results are provided and indicate the effectiveness of the approach and the potential of PN-based heuristic search for FMS scheduling.