Improved Beam Search for Optimizing No-Wait Flowshops With Release Times

IEEE Access

卷:8

Pei-Yu Lin¹  Pourya Pourhejazy¹  Kuo-Ching Ying¹  Chen-Yang Cheng¹  Shih-Wei Lin² 

[1] Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan;

[2] Department of Information Management, Chang Gung University, Taoyuan, Taiwan;

关键词: Flowshop scheduling;    no-wait;    release time;    beam search;   

DOI  :  10.1109/ACCESS.2020.3015737

来源: DOAJ

【 摘 要 】

Production management of perishable goods is highly complex and requires well-informed decisions in corresponding stages. In such production environments, scheduling problems with time constraints are of high relevance to ensure the timely flow of the work-in-process material and goods. This study introduces the no-wait flowshop scheduling problem with release times (NWFSP-RT) to help advance decision support systems in the food production industry. For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing makespan. A BS algorithm, and an improved variant, the local search-based Beam Search (BSLS) algorithms are developed to solve the NWFSP-RT problem. Extensive numerical analysis is conducted to analyze the performance of the algorithms in solving this highly intractable extension of the scheduling problems. We showed that BSLS effectively avoids early convergence and local optimality while dismissing non-promising search directions within a partial enumeration solution approach. The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. Applications of the developed heuristic are worthwhile research topics to pursue in solving other complex optimization problems.

【 授权许可】

Unknown