Show simple item record

dc.contributor.authorBaruwa, Olatunde
dc.contributor.authorPiera, Miquel Angel
dc.contributor.authorGuasch Petit, Antonio
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
dc.date.accessioned2015-05-28T13:24:17Z
dc.date.available2015-05-28T13:24:17Z
dc.date.created2015-05-01
dc.date.issued2015-05-01
dc.identifier.citationBaruwa, O.; Piera, M.A.; Guasch, A. Deadlock-free scheduling method for flexible manufacturing systems based on timed colored Petri nets and Anytime Heuristic Search. "IEEE Transactions on Systems, Man, and Cybernetics. Systems", 01 Maig 2015, vol. 45, núm. 5, p. 831-846.
dc.identifier.issn2168-2216
dc.identifier.urihttp://hdl.handle.net/2117/28096
dc.description.abstractThis paper addresses the deadlock (DL)-free scheduling problem of flexible manufacturing systems (FMS) characterized by resource sharing, limited buffer capacity, routing flexibility, and the availability of material handling systems. The FMS scheduling problem is formulated using timed colored Petri net (TCPN) modeling where each operation has a certain number of preconditions, an estimated duration, and a set of postconditions. Based on the reachability analysis of TCPN modeling, we propose a new anytime heuristic search algorithm which finds optimal or near-optimal DL-free schedules with respect to makespan as the performance criterion. The methodology tackles the time-constrained problem of very demanding systems (high diversity production and make-to-order) in which computational time is a critical factor to produce optimal schedules that are DL-free. In such a rapidly changing environment and under tight customer due-dates, producing optimal schedules becomes intractable given the time limitations and the NP-hard nature of scheduling problems. The proposed anytime search algorithm combines breadth-first iterative deepening A* with suboptimal breadth-first heuristic search and backtracking. It guarantees that the search produces the best solution obtained so far within the allotted computation time and provides better solutions when given more time. The effectiveness of the approach is evaluated on a comprehensive benchmark set of DL-prone FMS examples and the computational results show the superiority of the proposed approach over the previous works.
dc.format.extent16 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Automàtica i control
dc.subject.lcshPetri nets
dc.subject.lcshAutomatic control
dc.subject.lcshColor
dc.subject.lcshRobots
dc.subject.otherAnytime heuristic search
dc.subject.otherdeadlock-free
dc.subject.otherflexible manufacturing systems (FMS)
dc.subject.otherPetri nets (PN)
dc.subject.otherreachability analysis
dc.subject.otherscheduling
dc.subject.otherSTATE-SPACE EXPLORATION
dc.subject.otherSUPERVISORY CONTROL
dc.subject.otherPREVENTION POLICY
dc.subject.otherAVOIDANCE
dc.subject.otherVEHICLE
dc.subject.otherSIPHONS
dc.subject.otherCONTROLLERS
dc.subject.otherWORKCELLS
dc.subject.otherBLOCKING
dc.subject.otherCELLS
dc.titleDeadlock-free scheduling method for flexible manufacturing systems based on timed colored Petri nets and Anytime Heuristic Search
dc.typeArticle
dc.subject.lemacPetri, Xarxes de
dc.subject.lemacControl automàtic
dc.subject.lemacColor
dc.subject.lemacRobots
dc.contributor.groupUniversitat Politècnica de Catalunya. LIAM - Laboratori de Modelització i Anàlisi de la Informació
dc.identifier.doi10.1109/TSMC.2014.2376471
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.identifier.drac15643678
dc.description.versionPostprint (author’s final draft)
local.citation.authorBaruwa, O.; Piera, M.A.; Guasch, A.
local.citation.publicationNameIEEE Transactions on Systems, Man, and Cybernetics. Systems
local.citation.volume45
local.citation.number5
local.citation.startingPage831
local.citation.endingPage846


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder