Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem

摘要

The distributed shop scheduling has gained a great deal of attention due to its high-efficient collaboration and production. This paper studies a distributed no-wait flexible flow shop scheduling problem (DNWFFSP) with the makespan criterion, where each factory includes an identical flexible flow shop with no-wait constraint that requires each job to be processed without any waiting time between consecutive stages. A mixed-integer linear programming model for the DNWFFSP is presented. A machine selection method based on the first earliest available machine rule is presented. Three greedy factory assignment rules incorporating NEH (Nawaz-Enscore-Ham) heuristic are developed to allocate jobs into factories. Fourteen dispatch rules involving simple sorting and decomposition method are developed to construct a priority sequence of jobs. Thus, several constructive heuristics are obtained by combining dispatch rules and factory assignment rules. Furthermore, a constructive heuristic version of variable neighborhood descend is designed to address the DNWFFSP. One of constructive heuristics is selected to generate an initial solution, and five neighborhood search methods are used as the local search procedure. A comprehensive numerical comparison and statistical analysis are carried out to investigate the performance of the proposed approaches. The distributed NEH2 with smallest largest-medium rule obtains better results than other constructive heuristics for large-size instances.