Performance assessment of the metaheuristic optimization algorithms: an exhaustive review

AH Halim, I Ismail, S Das - Artificial Intelligence Review, 2021 - Springer
The simulation-driven metaheuristic algorithms have been successful in solving numerous
problems compared to their deterministic counterparts. Despite this advantage, the …

Iterated greedy algorithms for flow-shop scheduling problems: A tutorial

ZY Zhao, MC Zhou, SX Liu - IEEE Transactions on Automation …, 2021 - ieeexplore.ieee.org
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 …

A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop

C Lu, Q Liu, B Zhang, L Yin - Expert Systems with Applications, 2022 - Elsevier
Due to its practicality, hybrid flowshop scheduling problem (HFSP) with productivity objective
has been extensively explored. However, studies on HFSP considering green objective in …

A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem

F Zhao, X He, L Wang - IEEE transactions on cybernetics, 2020 - ieeexplore.ieee.org
Green scheduling in the manufacturing industry has attracted increasing attention in
academic research and industrial applications with a focus on energy saving. As a typical …

An effective hybrid collaborative algorithm for energy-efficient distributed permutation flow-shop inverse scheduling

J Mou, P Duan, L Gao, X Liu, J Li - Future Generation Computer Systems, 2022 - Elsevier
Distributed scheduling problem, a novel model of intelligent manufacturing, urgently needs
new scheduling methods to meet the dynamic market demand. The inverse scheduling in a …

Distributed scheduling problems in intelligent manufacturing systems

Y Fu, Y Hou, Z Wang, X Wu, K Gao… - Tsinghua Science and …, 2021 - ieeexplore.ieee.org
Currently, manufacturing enterprises face increasingly fierce market competition due to the
various demands of customers and the rapid development of economic globalization …

An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion

F Zhao, L Zhao, L Wang, H Song - Expert Systems with Applications, 2020 - Elsevier
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 …

Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept

AM Fathollahi-Fard, L Woodward, O Akhrif - Journal of Industrial …, 2021 - Elsevier
Based on a triple bottom line concept, sustainable development is characterized by the
simultaneous pursuit of economic, environmental and social goals. The implementation of …

An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems

QK Pan, L Gao, L Wang - IEEE Transactions on Cybernetics, 2020 - ieeexplore.ieee.org
This article addresses a novel scheduling problem, a distributed flowshop group scheduling
problem, which has important applications in modern manufacturing systems. The problem …

Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm

X Han, Y Han, Q Chen, J Li, H Sang… - Complex system …, 2021 - ieeexplore.ieee.org
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 …