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 …

The size, nature, and diversity of the initial population of population-based metaheuristic
algorithms and the number of times the algorithm iterates play a significant role in the …

This paper introduces a new flow shop combinatorial optimization problem, called the
blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers …

A situation where the set of initial solutions lies near the position of the true optimality (most
favourable or desirable solution) by chance can increase the probability of finding the true …

Distributed heterogeneous hybrid flow shop scheduling problem (DHHFSP) is an extension
of the classical hybrid flow shop scheduling problem (HFSP), which is an NP-hard problem …

Hybrid flowshop scheduling problem is a hot research topic, and is widely applied for
production shop or line in chemical industry, metallurgical industry, semiconductor …

This paper proposes a variant of the Gray Wolf Optimizer (GWO) called the Cross-
Dimensional Coordination Gray Wolf Optimizer (CDCGWO), which utilizes a novel learning …

The hybrid flow shop scheduling problem is one of the most relevant optimization problem in
manufacturing industry. In this paper, we investigate the blocking hybrid flow shop …

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

It is logical that organizations pay more attention to their major customers which have more
impacts on their abilities or benefits. In many real cases, decision makers in scheduling …