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 …

Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …

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

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 …

The flow shop scheduling problem is one of the most important types of scheduling with a
large number of real-world applications. In this paper, we propose a new algorithm that …

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

This paper combines the tabu search process with a genetic algorithm by employing a new
partial opposed-based as the population initialization technique to minimize makespan …

The classical flexible flow shop scheduling problem (FFSP) only considers machine
flexibility. Thus far, the relevant literature has not studied FFSPs with worker flexibility, which …

This paper proposes an effective new hybrid ant colony algorithm based on crossover and
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize the …

Meta-heuristic algorithms are problem-solving methods which try to find good-enough
solutions to very hard optimization problems, at a reasonable computation time, where …