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 …

This article investigates a distributed assembly no-wait flow-shop scheduling problem
(DANWFSP), which has important applications in manufacturing systems. The objective is to …

As economic globalization, large manufacturing enterprises build production centers in
different places to maximize profit. Therefore, scheduling problems among multiple …

We review the literature about shop scheduling problems in manufacturing systems,
revealing the concepts and methodologies that most impact the usage of scheduling theory …

This paper studies the distributed permutation flowshop group scheduling problem
(DPFGSP) with the consideration of minimizing total flowtime (TF), which has important …

With the development of the global economy and the enhancement of environmental
awareness, energy-efficient permutation flow shop scheduling gets more attention …

We consider the distributed blocking flowshop scheduling problem (DBFSP) which is a
meaningful generalization of the blocking flowshop scheduling problem in the distributed …

Distributed flow shop scheduling is a very interesting research topic. This paper studies the
distributed permutation flow shop scheduling problem with mixed no-idle constraints, which …

The distributed assembly blocking flow shop scheduling problem, which is a significant
scenario in modern supply chains and manufacturing systems, has attracted significant …

The distributed production scenario with the sequence-dependent setup times (SDST)
widely exists in the modern manufacturing system. This paper investigates the distributed …