Two FMS scheduling methods based on Petri nets: A global and a local approach

We are interested in the Flexible Manufacturing System (FMS) scheduling problem. Different methods have been explored to solve this problem and to master its combinatorial complexity, which is NP-hard in the general case. In this paper we will give two different scheduling methods based on Petri net...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2003-01, Vol.41 (7), p.1349-1371
Main Authors: Korbaa, Ouajdi, Benasser, Ahmer, Yim, Pascal
Format: Article
Language:English
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We are interested in the Flexible Manufacturing System (FMS) scheduling problem. Different methods have been explored to solve this problem and to master its combinatorial complexity, which is NP-hard in the general case. In this paper we will give two different scheduling methods based on Petri nets. The first one tends to solve the general scheduling problem (acyclic schedule) using the Constraint Programming method to avoid exhaustive search. The second method is a dedicated cyclic scheduling method. The aim is not to compare the methods' performances (computation time, results' quality) because they do not solve exactly the same problem, but to compare their application domains in terms of parts number.
ISSN:0020-7543
1366-588X
DOI:10.1080/0020754031000073008