Adaptive Large Neighborhood Search Heuristic for Mixed Blocking Flowshop Scheduling Problem

Authors : Damla KIZILAY, Zeynel Abidin ÇİL

Pages : 152-162

Doi:10.29132/ijpas.911146

View : 15 | Download : 10

Publication Date : 2021-06-30

Article Type : Research Paper

Abstract :Traditional permutation flowshop scheduling problem insert ignore into journalissuearticles values(PFSP);, which has unlimited buffer space, has been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as the aerospace industry and other sectors processing industrial waste, have different blocking conditions due to the limited or lack of buffer area between their machines. In this study, a mixture of different blocking types is considered to solve PFSP with the total flow time criterion regarding several blocking types. A constraint programming model is proposed to solve the PFSP with mixed blocking constraints insert ignore into journalissuearticles values(MBFSP);. Due to the problem`s NP-hard nature of the problem, an adaptive large neighborhood search heuristic is proposed to solve the large size instances. The results of the proposed algorithm are very competitive.
Keywords : Flowshop Scheduling, Adaptive Large Neighborhood Search, Constraint Programming