Scheduling flexible manufacturing systems using Petri nets and heuristic search
- 1 April 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 10 (2) , 123-132
- https://doi.org/10.1109/70.282537
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 presentedKeywords
This publication has 30 references indexed in Scilit:
- Integrated models for scheduling flexible manufacturing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A job completion time estimation method for work center schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On periodic schedules for deterministically timed Petri net systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of deterministic discrete event systems via minimax algebraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Job scheduling on parallel machines using simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Schedule generation and reconfiguration for parallel machinesIEEE Transactions on Robotics and Automation, 1990
- Robot control computation in microprocessor systems with multiple arithmetic processors using a modified DF/IHS scheduling algorithmIEEE Transactions on Systems, Man, and Cybernetics, 1989
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- A Review of Job Shop SchedulingJournal of the Operational Research Society, 1966
- On the Job-Shop Scheduling ProblemOperations Research, 1960