Deadlock-free Scheduling of Flexible Manufacturing Systems Subject to No-Wait Constraints

The scheduling problem of deadlock-prone flexible manufacturing systems (FMSs) subject to no-wait constraints is widespread in industrial production. Intricate constraints make it challenging to search optimal solutions with criteria of minimal makespan. The quality of a heuristic function largely d...

Full description

Saved in:
Bibliographic Details
Published inInternational Conference on Control, Automation and Robotics : proceedings pp. 130 - 135
Main Authors Yin, Pei, Luo, JianChao
Format Conference Proceeding
LanguageEnglish
Published IEEE 21.04.2023
Subjects
Online AccessGet full text
ISSN2251-2454
DOI10.1109/ICCAR57134.2023.10151725

Cover

More Information
Summary:The scheduling problem of deadlock-prone flexible manufacturing systems (FMSs) subject to no-wait constraints is widespread in industrial production. Intricate constraints make it challenging to search optimal solutions with criteria of minimal makespan. The quality of a heuristic function largely determines the performance and efficiency of a heuristic search algorithm. Based on a place-timed Petri net (PN) model, a novel heuristic function is developed and used in the A-star (\mathrm{A}^{\ast}) algorithm. Since it considers the deadlock-free and no-wait constraints, it owns stronger ability in choosing promising vertexes. Computational results demonstrate its superiority over the state-of-the art ones.
ISSN:2251-2454
DOI:10.1109/ICCAR57134.2023.10151725