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 …

Contemporary flowshops that are variants of the classical flowshop frequently pose
challenging scheduling problems. Such flowshops include no-wait, blocking, and robotic …

In the no-idle flowshop, machines cannot be idle after finishing one job and before starting
the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In …

The no-idle permutation flowshop scheduling problem (NIPFSP) extends the well-known
permutation flowshop scheduling problem, where idle time is not allowed on the machines …

In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle
permutation flowshop scheduling problem with the total tardiness criterion. The no-idle …

This paper presents a variable iterated greedy algorithm (IG) with differential evolution
(vIG_DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG …

This paper presents a hybrid discrete differential evolution (HDDE) algorithm for the no-idle
permutation flow shop scheduling problem with makespan criterion, which is not so well …

The rapid growth of distributed manufacturing in industry today has recently attracted
significant research attention that has focused on distributed scheduling problems. This work …

In this study, a novel general variable neighborhood search through Q-learning (GVNS-QL)
algorithm is proposed to solve the no-idle flowshop scheduling problem with the makespan …

This paper presents a memetic algorithm with hybrid node and edge histogram (MANEH) to
solve no-idle permutation flow shop scheduling problem (NIPFSP) with the criterion to …