Petri net modeling and scheduling for cyclic job shops with blocking

Computers and Industrial Engineering

Volumn 34, Issue 2-4, 1998, Pages 281-295

  Song, Ju Seog ^a   Lee, Tae Eog ^b  

^a KT Cooperation   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Cyclic job shop; Deadlock; Petri net; Scheduling

Indexed keywords

INTEGER PROGRAMMING; JUST IN TIME PRODUCTION; MATHEMATICAL MODELS; PETRI NETS; PROCESS CONTROL; SCHEDULING;

CYCLIC JOB SHOPS; SEQUENTIAL BUFFER CONTROL POLICY;

COMPUTER AIDED MANUFACTURING;

EID: 0032042832     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(97)00325-2     Document Type: Article

References (30)

1. Ahmadi, R. H. and Wurgaft, H., Design for synchronized flow manufacturing. Management Science, 40, 1994, 1469-1483.
2. Ahuza, R. K., Magnanti, T. L. and Orlin, J. B., Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliff, NJ, 1993.
3. Al-Jaar, R. Y. and Desrochers, A. A., Performance evaluation of automated manufacturing systems using generalized stochastic petri nets. IEEE Transactions on Robotics and Automation, 6, 1990, 621-639.
4. Baccelli, F., Cohen, G., Olsder, G. J. and Quadrat, J.-P., Synchronization and Linearity. Wiley, New York, 1992.
5. Chaar, J. K. and Davidson, E. S., Cyclic job shop scheduling using reservation tables, in The Proceedings of the 1990 IEEE International Conference on Robotics and Automation, Cincinnati, OH, 1990, pp. 2128-2135.
6. Ciardo, G., Muppala, J. K. and Trivedi, K. S., SPNP: stochastic petri net package, in International Conference on Petri Net and Petri Net model. Kyoto, Japan, 1989.
7. Esparza, J. and Silva, M., A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, 102, 1992, 185-205.
8. Hillion, H. P. and Proth, J.-M., Performance evaluation of job-shop systems using timed event-graphs. IEEE Transactions on Automatic Control, 34, 1989, 3-9.
9. Hitz, K. L., Scheduling of Flexible Flow Shops - II. Technical Report LIDS-R-1049, Laboratory for Information and Decision Systems, M.I.T., Cambridge, MA, 1980.
10. Kamoun, H. and Sriskandarajah, C., The complexity of scheduling jobs in repetitive manufacturing systems. European Journal of Operations Research, 70, 1993, 350-364.
11. Karabati, S. and Kouvelis, P., The interface of buffer design and cyclic scheduling decisions in deterministic flow lines. Annals of Operations Research, 50, 1994, 295-317.
12. Karp, R. M. and Orlin, J. B., Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics, 3, 1981, 37-45.
13. Lee, T. E., Periodic job shop scheduling. Ph.D. thesis, The Ohio State University, Columbus, OH, 1991.
14. Lee, T. E., Stable Earliest Starting Schedules for Periodic Job Shops: A Linear System Approach, in Proceedings of the 11th International Conference on Analysis and Optimization of Systems. Lecture Notes in Control and Information Science, Vol. 199. Springer, Berlin, pp. 290-296, 1994.
15. Lee, T. E. and Posner, M. E., Performance measures and schedule patterns in periodic job shops. Operations Research (in press).
16. Lee, T. E. and Seo, J. W., Stochastic Periodic Flow Lines: Non-blocking, Markovian Models. Technical Report IE96-6, Department of Industrial Engineering, KAIST, Korea, 1996.
17. Lindemann, C., DSPNExpress: a software package for efficient solution of deterministic stochastic petri nets, in Proceedings of Sixth international Conference on Modeling Techinques and Tools for Computer Performance Evaluations, Edinburgh, UK, pp. 15-29, 1992.
18. Matsuo, H., Cyclic sequencing problems in the two-machine permutation flow shop: complexity, worst-case, and average-case analysis. Naval Research Logistics, 37, 1990, 679-694.
19. McCormick, S. T., Pinedo, M. L., Shenker, S. and Wolf, B., Sequencing in an assembly line with blocking to minimize cycle time. Operations Research, 37, 1989, 925-935.
20. Murata, T., Petri nets: properties, analysis and application. Proceedings of the IEEE, 77, 1989, 541-580.
21. Muth, J. F. and Thompson, G. L., Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1969.
22. Peterson, J. L., Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Ciffs, NJ, 1981.
23. Ramadge, P. J. and Wonham, W. M., Supervisory contorl of a class of discrete event processes. SIAM Journal of Control and Optimization, 25, 1987, 206-230.
24. Ramamoorthy, C. V. and Ho, G. S., Performance evaluation of asynchronous concurrent systems using petri nets. IEEE Transactions on Software Engineering, SE-6, 1980, 440-449.
25. Ramchandani, C., Analysis of Asynchronous Concurrent Systems by Petri Nets. Project MAC TR-120. MIT, Cambridge, MA 1974.
26. Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J. and Kubiak, W., Sequencing of parts and robot moves in a robot cell. International Journal of Flexible Manufacturing Systems, 4, 1992, 331-358.
27. Silva, M., Introducing petri nets, in Practice of Petri Nets in Manufacturing. Chapman and Hall, London, 1993.
28. Song, J. S. and Lee, T. E., A tabu search procedure for periodic job shop scheduling. Computer and Industrial Engineering, 30, 1996, 433-447.
29. Song, J. S. and Lee, T. E., Steady State Analysis of Cyclic Shops with Blocking. Technical Report IE96-23, Department of Industrial Engineering, KAIST, Korea, 1996.
30. Zhou, M. C. and DiCesare, F., Modeling buffers in automated manufacturing systems using Petri nets, in Proceedings of Rensselaer's Second International Conference on Computer Integrated Manufacturing, Troy, NY, pp. 265-272, 1990.