Mixed Integer Programming‐Based Liveness Test for FMS with Full Routing Flexibility

Lida Dong, Tianyang Chi, Chengcheng Zhu and Jun Yin

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

Abstract: 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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/319281

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:319281

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().