Deadlock-free scheduling in flexible manufacturing systems using Petri nets

DOI10.1080/00207540210136496zbMath1083.90505OpenAlexW1991226180MaRDI QIDQ4710088

Imed Ben Abdallah, Tarek Y. Elmekkawy, Hoda A. ElMaraghy

Publication date: 13 October 2003

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540210136496

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items (4)

An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems ⋮ A Petri net-based framework for realistic project management and scheduling: an application in animation and videogames ⋮ Scheduling manufacturing systems with blocking: a Petri net approach ⋮ An estimation of distribution algorithm for scheduling problem of flexible manufacturing systems using Petri nets

Cites Work

• Unnamed Item
• A review of synthesis techniques for Petri nets with applications to automated manufacturing systems
• An efficient real-time deadlock-free control algorithm for automated manufacturing systems
• Avoidance of deadlocks in flexible manufacturing systems using a capacity-designated directed graph
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• A structured approach to deadlock detection, avoidance and resolution in flexible manufacturing systems
• Deadlock prediction and avoidance based on Petri nets for zone-control automated guided vehicle systems
• Deadlock avoidance policy for Petri-net modeling of flexible manufacturing systems with shared resources

This page was built for publication: Deadlock-free scheduling in flexible manufacturing systems using Petri nets