Mixed integer programming-based liveness test for FMS with full routing flexibility

DOI10.1155/2014/319281MaRDI QIDQ2336334zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yanyan Li

Publication date 19 November 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/319281

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete event control/observation systems (93C65)

Review text

Summary: Mixed integer programming (MIP) is an important technique to verify the liveness property of sequential flexible manufacturing systems (FMS) modeled by Petri nets. When there are some fully flexible routings in FMS, the existing MIP-based methods are not suitable for testing their liveness. This paper defines a subclass of S\(^*\)PR nets firstly, namely, OSC-S\(^*\)PR nets, and concludes that an OSC-S\(^*\)PR net is live if there exist no non-max'-controlled siphons. Accordingly, determining whether or not an OSC-S\(^*\)PR net is live can also be realized by using standardized mixed integer programming (MIP) tools. Furthermore, the liveness property of S\(^*\)PR nets can be tested in two steps: first, for a given S\(^*\)PR net, constructing an OSC-S\(^*\)PR net to ensure that if the latter is live then the former must be live; second, testing liveness of the constructed OSC-S\(^*\)PR net by the aforementioned MIP-based algorithm. In the end, the performance of the method is demonstrated by an application of FMS.

Recommendations

• Polynomial-time optimal liveness enforcement for guidepath-based transport systems
• Publication:3486350
• A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: threshold-based alternate routing
• Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems
• scientific article; zbMATH DE number 1300107
• OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing
• Enhanced mixed integer programming techniques and routing problems
• Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem

Cites work

• A Class of Well Structured Petri Nets for Flexible Manufacturing Systems
• Concurrency bugs in multithreaded software: modeling and analysis using Petri nets
• Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
• Deadlock prevention policy based on Petri nets and siphons

This page was built for publication: Mixed integer programming-based liveness test for FMS with full routing flexibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336334)