Intelligent scheduling covers various tools and techniques for successfully and efficiently
solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling …

This paper presents a literature review on the m-machine flow shop scheduling problem with
blocking conditions. In total, 139 papers are reviewed and classified, ranging from 1969 up …

The distribution of finished products from depots to customers is a practical and challenging
problem in logistics management. Better routing and scheduling decisions can result in …

Evolutionary computation has become an important problem solving methodology among
many researchers. The population-based collective learning process, selfadaptation, and …

This paper presents a novel hybrid algorithm (TABC) that combines the artificial bee colony
(ABC) and tabu search (TS) to solve the hybrid flow shop (HFS) scheduling problem with …

This paper proposes an iterated greedy algorithm for solving the blocking flowshop
scheduling problem for makespan minimization. Moreover, it presents an improved NEH …

In this paper, an effective hybrid algorithm based on particle swarm optimization (HPSO) is
proposed for permutation flow shop scheduling problem (PFSSP) with the limited buffers …

Recently, iterated greedy algorithms have been successfully applied to solve a variety of
combinatorial optimization problems. This paper presents iterated greedy algorithms for …

This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for
solving the blocking permutation flow shop scheduling problem with the makespan criterion …

This paper proposes an effective hybrid algorithm based on differential evolution (DE),
namely HDE, to solve multi-objective permutation flow shop scheduling problem (MPFSSP) …