In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve
the no-wait flowshop scheduling problem with both makespan and total flowtime criteria. The …

In this paper, a hybrid genetic algorithm is proposed to solve the no-wait flowshop
scheduling problem with the makespan objective. The proposed algorithm hybridizes the …

The scheduling problem in the no-wait or constrained flowshop, with the makespan
objective, is considered in this article. A simple heuristic algorithm is proposed on the basis …

We present two simple heuristic algorithms for scheduling to minimize makespan in the
constrained (or no-wait) flowshop. While developing the heuristics, we first present the …

This paper proposes a Tabu-mechanism improved iterated greedy (TMIIG) algorithm to
solve the no-wait flowshop scheduling problem with a makespan criterion. The idea of …

This paper addresses the m-machine no-wait flowshop scheduling problem to minimize
makespan. We propose two heuristics that are based on simulated annealing and Genetic …

An improved iterated greedy algorithm (IIGA) is proposed in this paper to solve the no-wait
flow shop scheduling problem with the objective to minimize the makespan. In the proposed …

This paper develops and compares different local search algorithms for the no-wait flow-
shop problem with makespan criterion (Cmax). We present several variants of descending …

This paper presents a new constructive heuristic, based on the principle of job insertion, for
minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical …

We consider the m-machine no-wait flowshop scheduling problem with respect to two
performance measures; total tardiness and makespan. Our objective is to minimize total …