Journal ArticleDOI
Performance evaluation of job-shop systems using timed event-graphs
H.P. Hillion,Jean-Marie Proth +1 more
TLDR
It is shown in particular that, given any desired product mix, it is possible to start the system with enough jobs in process so that some machines will be fully utilized in steady-state and the productivity is optimal.Abstract:
Timed event-graphs, a special class of timed Petri nets, are used for modelling and analyzing job-shop systems. The modelling allows the steady-state performance of the system to be evaluated under a deterministic and cyclic production process. Given any fixed processing times, the productivity (i.e., production rate) of the system can be determined from the initial state. It is shown in particular that, given any desired product mix, it is possible to start the system with enough jobs in process so that some machines will be fully utilized in steady-state. These machines are called bottleneck machines, since they limit the throughput of the system. In that case, the system works at the maximal rate and the productivity is optimal. The minimal number of jobs in process allowing optimal functioning of the system is further specified as an integer linear programming problem. An efficient heuristic algorithm is developed to obtain a near-optimal solution. >read more
Citations
More filters
Journal ArticleDOI
Petri nets and industrial applications: A tutorial
R. Zurawski,MengChu Zhou +1 more
TL;DR: The fundamental concepts of Petri nets are introduced to researchers and practitioners, both from academia and industry, who are involved in the work in the areas of modelling and analysis of industrial types of systems, as well as those who may potentially be involved in these areas.
Journal ArticleDOI
Deadlock avoidance in flexible manufacturing systems with concurrently competing process flows
Zbigniew Banaszak,Bruce H. Krogh +1 more
TL;DR: The authors develop a Petri net model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model to prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy.
Journal ArticleDOI
Petri nets for modeling of dynamic systems—a survey
René David,Hassane Alla +1 more
TL;DR: The aim of this paper is to present the basic concept relative to Petri nets and the various classes of derived models which can be used for dynamic system modeling.
Journal ArticleDOI
Scheduling flexible manufacturing systems using Petri nets and heuristic search
Doo Yong Lee,Frank DiCesare +1 more
TL;DR: Petri net modeling combined with heuristic search provides a new scheduling method for flexible manufacturing systems that can handle features such as routing flexibility, shared resources, lot sizes and concurrency.
Book
Supervisory Control of Discrete Event Systems Using Petri Nets
J.O. Moody,Panos J. Antsaklis +1 more
TL;DR: Supervisory Control of Discrete Event Systems Using Petri Nets is intended for graduate students, advanced undergraduates, and practicing engineers who are interested in the control problems of manufacturing, communication and computer networks, chemical process plants, and other high level control applications.
References
More filters
Book
Performance evaluation of asynchronous concurrent systems using Petri nets
C. V. Ramamoorthy,G. S. Ho +1 more
TL;DR: An extended timed Petri net model is used to model clearly the synchronization involved in these systems, and it is found that the computational complexity involved increases in the same order as they are listed above.
Journal ArticleDOI
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
TL;DR: An analogy between linear systems and a class of discrete-event systems is developed that can be viewed as linear, in the sense of an appropriate algebra, and the potentiality of this approach for the performance evaluation of repetitive production processes is illustrated.
Journal ArticleDOI
Marked directed graphs
TL;DR: A problem of maximal storage requirements for a simple flowchart model called the Marked Graph Model, which permits algorithnfic answers to problems which in their model were quite complex to solve, e.g., the termination problem.
Journal ArticleDOI
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
C. V. Ramamoorthy,G. S. Ho +1 more
TL;DR: In this article, an extended timed Petri net model is used to model the synchronization involved in real-time asynchronous concurrent systems, and procedures for predicting and verifying the system performance are presented.
Proceedings ArticleDOI
A heuristic algorithm for the periodic scheduling and sequencing job-shop problem
TL;DR: An heuristic algorithm is described to find a near optimal solution such that the bottleneck machines are fully utilized in steady-state with a minimal number of jobs in-process.