Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Deadlock-free scheduling method for flexible manufacturing systems based on timed colored Petri nets and Anytime Heuristic Search

Thumbnail
View/Open
Deadlock.pdf (836,0Kb)
Share:
 
 
10.1109/TSMC.2014.2376471
 
  View Usage Statistics
Cita com:
hdl:2117/28096

Show full item record
Baruwa, OlatundeMés informació
Piera, Miquel Angel
Guasch Petit, AntonioMés informacióMés informacióMés informació
Document typeArticle
Defense date2015-05-01
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessOpen Access
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
Abstract
This 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.
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. 
URIhttp://hdl.handle.net/2117/28096
DOI10.1109/TSMC.2014.2376471
ISSN2168-2216
Collections
  • Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial - Articles de revista [1.187]
  • LIAM - Laboratori de Modelització i Anàlisi de la Informació - Articles de revista [49]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Deadlock.pdf836,0KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina