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 …

Multiple jobs are processed simultaneously on a given batch processing machine in parallel
batching. The resulting batch is called a p-batch. Batching can lead to reduced production …

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

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

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 …

Large manufacturing firms operate more than one production center. As a result, in relation
to scheduling problems, which factory manufactures which product is an important …

Group scheduling problems have attracted much attention owing to their many practical
applications. This work proposes a new bi-objective serial-batch group scheduling problem …

To meet the multi-cooperation production demand of enterprises, the distributed permutation
flow shop scheduling problem (DPFSP) has become the frontier research in the field of …

Recently there have been significant developments and applications in the field of
unmanned aerial vehicles (UAVs). In a few years, these applications will be fully integrated …

Scheduling problem with blocking is an attractive research direction due to its wide practical
applications. However, in the distributed hybrid flow shop problem (DHFSP), there are few …