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

[1]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[2]  Alix Munier,et al.  Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources , 1991 .

[3]  Ouajdi Korbaa,et al.  A New Cyclic Scheduling Algorithm for Flexible Manufacturing Systems , 2002 .

[4]  Maciej Koutny,et al.  Optimal simulations, nets and reachability graphs , 1990, Applications and Theory of Petri Nets.

[5]  Ouajdi Korbaa,et al.  Formal approach of fms cyclic scheduling , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[6]  Ouajdi Korbaa,et al.  Transient state study for cyclic schedules: bounds and optimization , 1997, Proceedings of the 1997 IEEE International Symposium on Assembly and Task Planning (ISATP'97) - Towards Flexible and Agile Assembly and Manufacturing -.

[7]  P. Yim,et al.  Railway traffic planning with Petri Nets and constraint programming , 1999 .

[8]  Ahmer Benasser.  L'accessibilité dans les réseaux de Pétri : une approche basée sur la programmation par contraintes , 2000 .

[9]  Ouajdi Korbaa,et al.  Solving Transient Scheduling Problems with Constraint Programming , 2000, Eur. J. Control.

[10]  J. C. Gentina,et al.  A heuristic algorithm for the computation of cyclic schedules and the necessary WIP to obtain optimal cycle time , 1994, Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology.

[11]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[12]  Carlo Ghezzi,et al.  Analyzing refinements of state based specifications: the case of TB nets , 1993, ISSTA '93.

[13]  J. C. Gentina,et al.  Scheduling of FMS: An exact method based on CLP related to a cyclic scheduling approach , 1999 .

[14]  Jean-Marie Proth,et al.  Production management in a Petri net environment , 1995 .

[15]  Rémy Dupas,et al.  A genetic algorithm to solving the problem of flexible manufacturing system cyclic scheduling , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[16]  Ouajdi Korbaa,et al.  Solving transient scheduling problem for cyclic production using timed Petri nets and constraint programming , 1999, 1999 European Control Conference (ECC).

[17]  Jean-Marie Proth,et al.  Performance evaluation of job-shop systems using timed event-graphs , 1989 .

[18]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[19]  Manuel Silva Suárez,et al.  Petri nets and flexible manufacturing , 1988, European Workshop on Applications and Theory in Petri Nets.

[20]  Frank DiCesare,et al.  Scheduling flexible manufacturing systems using Petri nets and heuristic search , 1994, IEEE Trans. Robotics Autom..

[21]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[22]  C. V. Ramamoorthy,et al.  Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , 1980, IEEE Transactions on Software Engineering.

[23]  G. L. Thompson.  Recent developments in the job‐shop scheduling problem , 1960 .