An effective matheuristic algorithm for distributed permutation flowshop problem
HE Xuan
DI Shilu
LIU Huan
DU Songlin
GUO Hengwei
SHAO Zhongshi
Abstract：In recent years,the manufacturing model of enterprises has changed from traditional single-fac-tory centralized production to distributed collaborative production of multiple factories distributed in differ-ent geographical locations.Distributed permutation flowshop scheduling problem has emerged.Although a lot of research has been done on this problem in academia,studying its efficient solution method is still an open topic.This paper compares the advantages and disadvantages of two existing mixed integer pro-gramming models for the total flow time optimization objective,and obtains the optimal solution on a small-scale problem instance.For large-scale problem instances,this paper proposes an effective matheu-ristic algorithm.Based on the existing DLR-DNEH,the proposed matheuristic algorithm designs a set covering model to collect effective search patterns contained in insertion neighborhood structure.Finally,a large number of experimental results on the standard test set show the effectiveness of the proposed algo-rithm.
Keywords：distributed permutation flowshop scheduling problemtotal flow timematheuristic algo-rithmset covering model
Publication Date：2025-08-01
Online Publishing Date：2026-08-28(First online date of this platform, not the publication date of the document)
Pages：10( 475-484 )