Scheduling of FMS: An exact method based on CLP related to a cyclic scheduling approach

Abstract This paper deals with the contribution of Petri net (PN) modelling used for the computation of the scheduling of Flexible Manufacturing Systems (FMS). Two recent techniques of scheduling ((Korbaa and Gentina, 1997) and (Benasser et al., 1996)) are proposed using both PN (see (Murata, 1989) for concepts and notations). The first one deals with a heuristic in order to compute a cyclic command. The second one is based on an efficient reachability search in timed Petri nets by means of constraints propagation techniques. An example will be developed in this paper to illustrate the main results.

[1]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[2]  Jan Magott.  New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets , 1987, IEEE Transactions on Software Engineering.

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

[4]  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 -.

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

[6]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[7]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[8]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[9]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..