Scheduling flexible manufacturing systems using Petri nets and heuristic search
01 Apr 1994-Vol. 10, Iss: 2, pp 123-132
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.
Abstract: Petri net modeling combined with heuristic search provides a new scheduling method for flexible manufacturing systems. The method formulates a scheduling problem with a Petri net model. Then, it generates and searches a partial reachability graph to find an optimal or near optimal feasible schedule in terms of the firing sequence of the transitions of the Petri net model. The method can handle features such as routing flexibility, shared resources, lot sizes and concurrency. By following the generated schedule, potential deadlocks in the Petri net model and the system can be avoided. Hence the analytical overhead to guarantee the liveness of the model and the system is eliminated. Some heuristic functions for efficient search are explored and the experimental results are presented. >
Citations
More filters
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.
Abstract: Petri nets, as a graphical and mathematical tool, provide a uniform environment for modelling, formal analysis, and design of discrete event systems. The main objective of this paper is to introduce the fundamental concepts of Petri nets 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. The paper begins with an overview of applications of Petri nets, mostly industrial ones. Then, it proceeds with a description of Petri nets, properties, and analysis methods. The discussion of properties is put in the context of industrial applications. The analysis methods are illustrated using an example of a simple robotic assembly system. The performance analysis, using Petri nets, is discussed for deterministic and stochastic Petri nets. The presented techniques are illustrated by examples representing simple production systems. In addition, the paper introduces high-level Petri nets, fuzzy Petri nets, and temporal Petri nets. This is done in the context of application prospects. The paper also briefly discusses some of the reasons restricting the use of Petri nets, mostly, to academic institutions. >
615 citations
TL;DR: A formal approach such as Petri nets enables one to describe such complex discrete event systems precisely and thus allows one to perform both qualitative and quantitative analysis, scheduling and discrete-event control of them.
Abstract: This paper presents a Petri net approach to modeling, analysis, simulation, scheduling, and control of semiconductor manufacturing systems. These systems can be characterized as discrete event systems that exhibit sequential, concurrent, and conflicting relations among the events and operations. Their evolution is dynamic over time. The system complexity is tremendous owing to the complex semiconductor manufacturing processes and test procedures. A formal approach such as Petri nets enables one to describe such complex discrete event systems precisely and thus allows one to perform both qualitative and quantitative analysis, scheduling and discrete-event control of them. This paper also serves as a tutorial paper. It briefly reviews applications of Petri nets in semiconductor manufacturing automation. It then introduces definitions and concepts of Petri nets. It proceeds with a discussion of basic Petri net modules in system modeling, a modeling method and a practical system's modeling example. Next, the paper presents their properties and their implications in manufacturing systems, as well as their analysis methods. Timed Petri nets are introduced for system simulation, performance evaluation, and scheduling purposes. An application-oriented case study is presented. Finally, the paper concludes with the active research areas in applying Petri nets to design of semiconductor manufacturing systems.
291 citations
TL;DR: An Improved Genetic Algorithm to solve the Distributed and Flexible Job-shop Scheduling problem is proposed and has been compared with other algorithms for distributed scheduling and evaluated with satisfactory results on a large set of distributed-and-flexible scheduling problems derived from classical job-shop scheduling benchmarks.
252 citations
TL;DR: A two-stage Hybrid Genetic Algorithm is proposed to generate the predictive schedule, which optimizes the primary objective, minimizing makespan in this work, where all the data is considered to be deterministic with no expected disruptions.
213 citations
01 Jan 2012
TL;DR: A deadlock prevention method that makes a good tradeoff between optimality and computational tractability for a class of Petri nets, which can model many FMS.
Abstract: Deadlocks are an undesirable situation in automated flexible manufacturing systems (FMS) Their occurrences often deteriorate the utilization of resources and may lead to catastrophic results Finding an optimal supervisor is NP-hard A computationally efficient method often ends up with a suboptimal one This paper develops a deadlock prevention method that makes a good tradeoff between optimality and computational tractability for a class of Petri nets, which can model many FMS The theory of regions guides our efforts toward the development of near-optimal solutions for deadlock prevention Given a plant net, a minimal initial marking is first decided by structural analysis, and an optimal live controlled system is computed Then, a set of inequality constraints is derived with respect to the markings of monitors and the places in the model such that no siphon can be insufficiently marked A method is proposed to identify the redundancy condition for constraints For a new initial marking of the plant net, a deadlock-free controlled system can be obtained by regulating the markings of the monitors such that the inequality constraints are satisfied, without changing the structure of the controlled system The near-optimal performance of a controlled net system via the proposed method is shown through several examples
153 citations
Additional excerpts
...It is said that a ∈ A belongs to Ω, denoted by a ∈ Ω, if Ω(a) > 0....
[...]
References
More filters
Book•
01 Jan 1980TL;DR: This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Abstract: A classic introduction to artificial intelligence intended to bridge the gap between theory and practice, "Principles of Artificial Intelligence" describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval. Rather than focusing on the subject matter of the applications, the book is organized around general computational concepts involving the kinds of data structures used, the types of operations performed on the data structures, and the properties of the control strategies used. "Principles of Artificial Intelligence"evolved from the author's courses and seminars at Stanford University and University of Massachusetts, Amherst, and is suitable for text use in a senior or graduate AI course, or for individual study.
3,754 citations
Book•
01 Jan 1974
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Abstract: (1977). Introduction to Sequencing and Scheduling. Journal of the Operational Research Society: Vol. 28, No. 2, pp. 352-353.
2,640 citations
Book•
[...]
01 Jan 1967
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Abstract: Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will concern you to try reading theory of scheduling as one of the reading material to finish quickly.
2,356 citations
Book•
01 Jan 1981
TL;DR: In this paper, the authors present the basis of a course intended to provide relevant analytical skills, and also an awareness of, institutional and environmental issues arising in urban situations and focus on certain urban service systems including delivery services, emergency services, transport services, street maintenance and social services.
Abstract: The book presents the basis of a course intended to provide relevant analytical skills, and also an awareness of, institutional and environmental issues arising in urban situations and focuses on certain urban service systems including delivery services, emergency services, transport services, street maintenance and social services. The following chapters discuss various aspects: 1) introduction; 2) brief review of probabilistic modeling; 3) functions of random variables and geometrical probability; 4) introduction to queueing theory and its applications; 5) spatially distributed queues; 6) applications of network models; 7) simulation in the urban context; and, 8) implementation. (TRRL)
670 citations