Scheduling analysis of FMS: An unfolding timed Petri nets approach

We are interested in Flexible Manufacturing Systems (FMS) scheduling problem. Different methods have been explored to solve this problem and mainly to master its combinatorial complexity: NP-hard in the general case. This paper presents an analysis of the cyclic scheduling for the determination of the optimal cycle time and the minimization of the Work In Process (WIP). Especially, the product ratio-driven FMS cyclic scheduling problem using timed Petri nets (TPN) unfolding is described. In addition, it has been proved that the Basic Unit of Concurrency (BUC) is a set of the executed control flows based on the behavioral properties of the net. Using our method, one could divide original system into some subnets based on machine's operations using BUC and analyze the feasibility time in each schedule. Herein, our results showed the usefulness of transitive matrix to slice off some subnets from the original net, and explained in an example.

[1]  Wlodzimierz M. Zuberek,et al.  Throughput analysis of manufacturing cells using timed Petri nets , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[2]  Takashi Sekiguchi,et al.  A research on Petri net properties using transitive matrix , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[3]  Ouajdi Korbaa,et al.  Scheduling Analysis in FMS using the Unfolding Time Petri Nets , 2001 .

[4]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[5]  Xiao-lan Xie,et al.  A heuristic algorithm for the periodic scheduling and sequencing job-shop problem , 1987, 26th IEEE Conference on Decision and Control.

[6]  Jong-Kun Lee.  A Scheduling Analysis in FMS Using the Transitive Matrix , 2004, AIS.

[7]  Philippe Chrétienne,et al.  Timed Petri net schedules , 1987, European Workshop on Applications and Theory of Petri Nets.

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

[9]  Dongik Lee,et al.  A concurrency characteristic in Petri net unfolding , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[10]  Michael Kishinevsky,et al.  Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings , 1998, Formal Methods Syst. Des..

[11]  Ouajdi Korbaa,et al.  Modeling and scheduling of ratio-driven FMS using unfolding time Petri nets , 2004, Comput. Ind. Eng..

[12]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..

[13]  Frank DiCesare,et al.  Petri Net-Based Heuristic Scheduling for Flexible Manufacturing , 1995 .

[14]  Pascal Richard.  Scheduling Timed Marked Graphs with Resources: A Serial Method , 1998 .

[15]  Maurizio Tazza,et al.  CALCUL D'UN ORDONNANCEMENT FAISABLE SOUS UN ENSEMBLE DE CONTRAINTES CYCLIQUES COMPUTING A FEASIBLE SCHEDULE UNDER A SET OF CYCLIC CONSTRAINTS , 2007 .

[16]  J. C. Gentina,et al.  Petri net modeling of ratio-driven flexible manufacturing systems and implications on the WIP for cyclic schedules , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

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