An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely
used to solve flow-shop scheduling problems (FSPs), an important branch of production …

Abstract The Distributed Permutation Flowshop Scheduling (DPFS) problem is one of the
fastest-growing topics in the scheduling literature, which in turn is among the most prolific …

With the development of economic globalization, distributed hybrid flow shop scheduling
problem (DHFSSP) has become prevalent in realistic manufacturing systems. Moreover, to …

In this study, a self-learning discrete Jaya algorithm (SD-Jaya) is proposed to address the
energy-efficient distributed no-idle flow-shop scheduling problem (FSP) in a heterogeneous …

Currently, manufacturing enterprises face increasingly fierce market competition due to the
various demands of customers and the rapid development of economic globalization …

The distributed no-idle permutation flowshop scheduling problem (DNIPFSP) has widely
existed in various manufacturing systems. The makespan and total tardiness are optimized …

The distributed blocking flowshop scheduling problem (DBFSP) plays an essential role in
the manufacturing industry and has been proven to be as a strongly NP-hard problem. In this …

Distributed permutation flowshop scheduling problem (DPFSP) has become a very active
research area in recent years. However, minimizing total flowtime in DPFSP, a very relevant …

The distributed assembly mixed no-idle permutation flowshop scheduling problem
(DAMNIPFSP), a common occurrence in modern industries like integrated circuit production …

In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel
batching distributed flow-shop problem (DFSP) with deteriorating jobs. In the considered …