Scheduling involving no-wait in process plays an important role in industries such as plastic,
chemical, and pharmaceutical. Moreover, many scheduling problems in other industries …

One of the most widely studied problems in flow shop scheduling is not allowing jobs to wait
to be processed at the next stage. This constraint causes the job to be processed …

In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …

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 presents the distributed no-wait flowshop scheduling problem (DNFSP), which is
the first attempt in the literature to solve this key problem faced by the manufacturing …

The no-wait flowshop scheduling problem (NWFSP) with makespan minimization is a well-
known strongly NP-hard problem with applications in various industries. This study …

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 …

This paper addresses minimizing makespan of the distributed no-wait flow shop scheduling
problem where there are several identical factories that work in parallel. There are jobs with …

In this paper, the no-wait flow shop scheduling problem under makespan and flowtime
criteria is addressed. The no-wait flowshop is a variant of the well-known flowshop …

Inspired by the phenomenon of teaching and learning introduced by the teaching-learning
based optimization (TLBO) algorithm, this paper presents a hybrid discrete optimization …