Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Modeling and Control of Discrete-event Dynamic Systems: with Petri Nets and Other Tools
Modeling and Control of Discrete-event Dynamic Systems: with Petri Nets and Other Tools
Petri net modeling and deadlock analysis of parallel manufacturing processes with shared-resources
Journal of Systems and Software
CEEMAS'03 Proceedings of the 3rd Central and Eastern European conference on Multi-agent systems
Modeling the dynamics of concurrent computing systems
Computers & Mathematics with Applications
On Siphon Computation for Deadlock Control in a Class of Petri Nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Analysis of the Petri net model of parallel manufacturing processes with shared resources
Information Sciences: an International Journal
| Hi-index | 0.09 |
This paper addresses the Petri net (PN) based design and modeling approach for a periodic job-shop scheduling problem. Asynchronous synthesis for net-modules of the jobs is suggested in this paper for optimal allocation of shared resources to different operations. To make sure the completion of all the jobs in a single iteration of a production cycle and the correct calculation of a makespan, the synchronization problem among jobs is tackled by introducing the special synchronizing transition in the model. A timed-place PN is adopted for the purpose of finding the feasible schedule in terms of the firing sequence of the transitions of the PN model by using the heuristic search method. Further, the characterization of the PN model is performed and it is shown that the PN model for a periodic job-shop scheduling problem is equivalent to a class of PN known as parallel process net with resources (PPNRs). The modeling approach is demonstrated with a practical example and a makespan is calculated for the example.