Formal approach of fms cyclic scheduling

This correspondence is related to the determination of both control and scheduling of flexible manufacturing systems under cyclic command. Different approaches can be found in the literature, but we focus on those which respect the optimal throughput while minimizing the work in process. So, we recall methods of performance evaluation developed during the last 20 years. The last part is devoted to a new approach of cyclic scheduling using a Petri net. This method uses algebraic tools (dioids) developed for the study of marked graphs. In this way, the problem of the scheduling is progressively transformed into a problem of the search of solution(s) on a system of equations

[1]  S. Gaubert.  Resource optimization and (min, +) spectral theory , 1995, IEEE Trans. Autom. Control..

[2]  Imre Simon,et al.  Limited subsets of a free monoid , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3]  G. Goncalves,et al.  A genetic approach to the scheduling of preventive maintenance tasks on a single product manufacturing production line , 2001 .

[4]  Kenji Onaga,et al.  On periodic schedules for deterministically timed Petri net systems , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[5]  J. C. Gentina,et al.  On the modelling of the dynamical behaviour of weighted T-systems , 2002 .

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

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

[8]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[9]  J. Quadrat,et al.  A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[10]  J. Quadrat,et al.  Algebraic tools for the performance evaluation of discrete event systems , 1989, Proc. IEEE.

[11]  G. Cohen,et al.  Idempotency: Algebraic system analysis of timed Petri nets , 1998 .

[12]  G. Cohen,et al.  Timed-event graphs with multipliers and homogeneous min-plus systems , 1998, IEEE Trans. Autom. Control..

[13]  Richard Bellman,et al.  Mathematical Aspects Of Scheduling And Applications , 1982 .

[14]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

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

[16]  Ouajdi Korbaa,et al.  Heuristic for the resolution of the general FMS cyclic scheduling problem , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

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

[18]  Laurent Hardouin,et al.  Timed event graphs with variable resources : Asymptotic behavior, representation in (min, +) algebra , 1999 .

[19]  Joseph Sifakis,et al.  Structural Properties of Petri Nets , 1978, MFCS.

[20]  J. Quadrat,et al.  Analyse du comportement periodique de systemes de production par la theorie des dioides , 1983 .

[21]  Stéphane Gaubert,et al.  Methods and Applications of (MAX, +) Linear Algebra , 1997, STACS.

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

[23]  A. Di Febbraro,et al.  Work-in-progress optimization of cyclic manufacturing systems with assigned throughputs , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[24]  Yves Crama,et al.  Cyclic scheduling in 3-machine robotic flow shops , 1999 .

[25]  Manuel Silva Suárez,et al.  On Weighted T-Systems , 1992, Application and Theory of Petri Nets.

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

[27]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

[28]  Jongkun Lee.  Une méthode d'analyse d'ordonnancement des systèmes flexibles de production manufacturière utilisant le dépliage des réseaux de Pétri , 2002 .

[29]  Zhen Qiang.  On Liveness and Safeness for Weighted Extended Free Choice Nets , 2000 .