N-list-enhanced heuristic for distributed three-stage assembly permutation flow shop scheduling
Kuo‐Ching Ying, Pourya Pourhejazy, Po-Jui Fu
Abstract
Abstract System-wide optimization of distributed manufacturing operations enables process improvement beyond the standalone and individual optimality norms. This study addresses the production planning of a distributed manufacturing system consisting of three stages: production of parts (subcomponents), assembly of components in Original Equipment Manufacturer (OEM) factories, and final assembly of products at the product manufacturer’s factory. Distributed Three Stage Assembly Permutation Flowshop Scheduling Problems (DTrSAPFSP) models this operational situation; it is the most recent development in the literature of distributed scheduling problems, which has seen very limited development for possible industrial applications. This research introduces a highly efficient constructive heuristic to contribute to the literature on DTrSAPFSP. Numerical experiments considering a comprehensive set of operational parameters are undertaken to evaluate the performance of the benchmark algorithms. It is shown that the N-list-enhanced Constructive Heuristic algorithm performs significantly better than the current best-performing algorithm and three new metaheuristics in terms of both solution quality and computational time. It can, therefore, be considered a competitive benchmark for future studies on distributed production scheduling and computing.