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 …

Carbon peaking and carbon neutrality, which are the significant national strategy for
sustainable development, have attracted considerable attention from production enterprises …

The distributed flexible job-shop scheduling problem (DFJSP) is an extension of the flexible
job shop scheduling problem, which is a famous NP-complete combinatorial optimization …

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

A distributed flow-shop scheduling problem with lot-streaming that considers completion
time and total energy consumption is addressed. It requires to optimally assign jobs to …

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 …

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 …

A hyper-heuristic algorithm is a general solution framework that adaptively selects the
optimizer to address complex problems. A classical hyper-heuristic framework consists of …

With the continuous development of national economies, problems of various energy
consumption levels and pollution emissions in manufacturing have attracted attention from …