Modeling and scheduling of ratio-driven FMS using unfolding time Petri nets

Computers and Industrial Engineering

Volumn 46, Issue 4 SPEC. ISS., 2004, Pages 639-653

  Lee, Jongkun ^a   Korbaa, Ouajdi ^b  

^a Changwon National University   (South Korea)

^b Ecole Centrale Lille   (France)

Author keywords

Cycle time; Cyclic scheduling; Flexible manufacturing systems; Modeling; Petri nets; Work in process

Indexed keywords

COMPUTER SIMULATION; FLEXIBLE MANUFACTURING SYSTEMS; INDUSTRIAL ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING; PRODUCTION CONTROL; SET THEORY; THROUGHPUT;

CYCLE TIME; CYCLIC SCHEDULING; PRODUCTION MANAGEMENT; WORK IN PROCESS;

PETRI NETS;

EID: 3242697916     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2004.05.015     Document Type: Conference Paper

References (17)

1. Camus, H (1997). Conduite de systèmes Flexibles de Production Manufacturière par composition de régimes permanents cycliques: modélisation et évaluation de performances à l'aide des Réseaux de Petri. PhD Thesis, March 1997, University of Lille I, France (in French).
2. Carlier J., Chretienne P. Timed petri nets schedules. Rozenberg G. Advanced in PN'1988, Vol. 340 of LNCS. 1988;62-84 Springer, Berlin.
3. Esparza J., Lomer S., Vogler W. An improvement of McMillans unfolding algorithms. LNCS 1055. 1996;. pp. 87-106.
4. Hillion, H., Proth, J.-M., & Xie, X.-L. (1987). A heuristic algorithm for the periodic scheduling and sequence job-shop problem. Proceedings of 26th CDC 1987, pp. 612-617.
5. Hwang C.H., Lee D.I. A concurrency characteristic in petri net unfolding. Proceedings of SMC'97. 1997;. pp. 4266-4273.
6. Julia S., Valette R., Tazza M. Computing a feasible schedule under a set of cyclic constraints. Second International Conference on Industrial Automation, Nancy, France. 1995;. pp. 141-146.
7. Kondratyev A., Kishinevsky M., Taubin A., Ten S. Analysis of petri nets by ordering relations in reduced unfolding. 1996;Kluwer, Boston.
8. Korbaa, O., Camus, H., Gentina, J.-C., "FMS cyclic scheduling with overlapping production cycles", in proceedings of 2nd IWMP, pp. 35-53.
9. Lee D.Y., DiCesare F. Petri net-based heuristic scheduling for flexible manufacturing. Zhou M.C. Petri nets in flexible and agile automation. 1995;149-187 Kluwer, Dordecht.
10. Liu J., Itoh Y., Miyazawa I., Seikiguchi T. A research on petri nets properties using transitive matrix. Proceedings of IEEE SMC'99. 1999;. pp. 888-893.
11. McMillan K. A technique of state space search based on unfolding. Formal Methods in System Design. 6:(1):1995;45-65.
12. Murata T. Petri nets: Properties, analysis and applications. Proceedings of the IEEE. 77:(4):1989;541-580.
13. Ohl H., Camus H., Castelain E., Gentina J.-C. Petri nets modeling of ratio-driven FMS and implication on the WIP for cyclic schedules. Proceedings of IEEE SMC. 1995;. pp. 3081-3086.
14. Richard P. Scheduling timed marked graphs with resources: A serial method. Proceedings of INCOM'98. 1998.
15. Taubin A., Kondratyev A., Kishnevsky M. Application of PN unfolding to asynchronous design. Proceedings of IEEE-SMC 1997. 1997;. pp. 4279-4284.
16. Valentin C. Modeling and analysis methods for a class of hybrid dynamic systems. Proceedings of Symposium ADPM'94. 1994;. pp. 221-226.
17. Zuberek W., Kubiah W. Throughput analysis of manufacturing cells using timed petri nets. Proceedings of ICSYMC 1993. 1993;. pp. 1328-1333.