AB&B: An Anytime Branch and Bound Algorithm for Scheduling of Deadlock-Prone Flexible Manufacturing Systems

This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net model and a highly permissive deadlock con...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automation science and engineering Ročník 18; číslo 4; s. 2011 - 2021
Hlavní autoři: Luo, Jianchao, Zhou, Mengchu, Wang, Jun-Qiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Anytime branch and bound (AB&B) algorithm
discrete event systems
flexible manufacturing system (FMS)
Flexible manufacturing systems
Frequency modulation
Job shop scheduling
Lower bounds
machine learning
Manufacturing systems
Mathematical models
optimization
Parameters
Petri net (PN)
Petri nets
Production
Schedules
Scheduling
Scheduling algorithms
System recovery
Task scheduling
ISSN:1545-5955, 1558-3783
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This work investigates a scheduling problem of deadlock-prone flexible manufacturing systems modeled by place-timed Petri nets. It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net model and a highly permissive deadlock controller. The proposed algorithm searches a sequence of transitions in the branch tree that evolves the model from the initial marking to the final one. In order to prune the branch tree and increase search speed, this work develops two pruning rules, a lower bound of makespan, and a novel branching strategy. Their usage ensures AB&B's high search efficiency. Experimental results demonstrate that the proposed algorithm surpasses the state-of-the-art ones. Note to Practitioners -In practice, scheduling is one of the most important issues for production managers to address. Existing approaches to deadlock-prone flexible manufacturing system (FMS) scheduling have multiparameters. Their settings can impact the scheduling results greatly. Since their turning is a challenging task, it is difficult to find the best parameter settings. This article proposes an anytime branch and bound (AB&B) algorithm for minimizing the makespan of deadlock-prone FMSs. It has only one parameter, i.e., maximal CPU time, which needs no turning. When it is highly tight, AB&B can output a feasible and decent schedule. If it is larger and larger, AB&B can output a better and better schedule. Comparison studies show that AB&B outclasses existing ones significantly. It is suitable for real-time scheduling cases in which satisfied schedules must be offered in a very short time.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1545-5955
1558-3783
DOI:10.1109/TASE.2020.3029737