Back to Search Start Over

An effective Hybrid Petri net and Tabu Search for Parallel Machines Scheduling with Availability Constraint.

Authors :
Kaid, Husam
Al-Ahmari, Abdulrahman
Nasr, Emad Abouel
Al-Shayea, Adel
Kamrani, Ali K.
El-Meligy, Mohammed A.
Mahmoud, Haitham A.
Source :
Proceedings of the International Conference on Industrial Engineering & Operations Management; 6/12/2022, p312-322, 11p
Publication Year :
2022

Abstract

Machines can become unavailable during the planning horizon due to unexpected breakdowns. Such periods of unavailability should be properly taken into account when designing the production schedule. This paper proposes an optimal solution to unrelated parallel machine scheduling problems with availability constraints based on timed Petri nets (TPNs) to minimize the maximum completion time of jobs. For this NP-hard problem, a new hybrid Petri net and tabu search (PNTS) approach is proposed to find an optimal solution for this problem. A numerical example is used to assess the performance of the proposed PNTS. The computational results highlight the ability of the proposed PNTS to obtain optimal solutions for this problem. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
21698767
Database :
Complementary Index
Journal :
Proceedings of the International Conference on Industrial Engineering & Operations Management
Publication Type :
Conference
Accession number :
160126679