Two FMS scheduling methods based on Petri nets: A global and a local approach |
| |
Authors: | Ouajdi Korbaa Ahmer Benasser Pascal Yim |
| |
Affiliation: | Ecole Centrale de Lille , Lail Upresa 8021, Villeneuve d'Ascq Cedex, F 59651, France |
| |
Abstract: | 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. |
| |
Keywords: | |
|
|