A Population-Based Iterated Greedy Algorithm for Distributed Assembly No-Wait Flow-Shop Scheduling Problem

doi:10.1109/TII.2022.3192881

A Population-Based Iterated Greedy Algorithm for Distributed Assembly No-Wait Flow-Shop Scheduling Problem

2023-05-01

49

PRE

AI

DOI：10.1109/TII.2022.3192881

原文链接

原文求助

摘要

En 中文

This article investigates a distributed assembly no-wait flow-shop scheduling problem (DANWFSP), which has important applications in manufacturing systems. The objective is to minimize the total flowtime. A mixed-integer linear programming model of DANWFSP with total flowtime criterion is proposed. A population-based iterated greedy algorithm (PBIGA) is presented to address the problem. A new constructive heuristic is presented to generate an initial population with high quality. For DANWFSP, an accelerated NR3 algorithm is proposed to assign jobs to the factories, which improves the efficiency of the algorithm and saves CPU time. To enhance the effectiveness of the PBIGA, the local search method and the destruction-construction mechanisms are designed for the product sequence and job sequence, respectively. A selection mechanism is presented to determine, which individuals execute the local search method. An acceptance criterion is proposed to determine whether the offspring are adopted by the population. Finally, the PBIGA and seven state-of-the-art algorithms are tested on 810 large-scale benchmark instances. The experimental results show that the presented PBIGA is an effective algorithm to address the problem and performs better than recently state-of-the-art algorithms compared in this article.

Keyword:

Production facilities

Job shop scheduling

Statistics

Sociology

Greedy algorithms

Search problems

Processor scheduling

Distributed assembly scheduling

iterated greedy algorithm

no-wait flow-shop

total flowtime

A Population-Based Iterated Greedy Algorithm for Distributed Assembly No-Wait Flow-Shop Scheduling Problem

摘要

期刊

机构