This paper is a complete survey of flowshop-scheduling problems and contributions from
early works of Johnson of to recent approaches of metaheuristics of 2004. It mainly …

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 …

This book is an outgrowth of an earlier text that appeared in 1999 under the title “Operations
Scheduling with Applications in Manufacturing and Services”, coauthored with Xiuli Chao …

This paper proposes a novel hybrid discrete differential evolution (HDDE) algorithm for
solving blocking flow shop scheduling problems to minimize the maximum completion time …

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 …

An integrated line planning and timetabling model is formulated with the objective of
minimizing both user inconvenience and operational costs. User inconvenience is modeled …

This paper develops a fast tabu search algorithm to minimize makespan in a flow shop
problem with blocking. Some properties of the problem associated with the blocks of jobs …

In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search
(hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified …

The blocking flowshop scheduling problem with makespan criterion has important
applications in a variety of industrial systems. Heuristics that explore specific characteristics …