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 …

This paper proposes an effective new hybrid ant colony algorithm based on crossover and
mutation mechanism for no-wait flow shop scheduling with the criterion to minimize 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 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 …

In this paper, preventive maintenance (PM) operations are incorporated as a constraint to
the m-machine no-wait flow shop problem with dependent-sequence setup times and …

Nowadays, distributed scheduling problem is a reality in many companies. Over the last
years, an increasingly attention has been given to the distributed flow shop scheduling …

This study investigates the no-wait flow shop scheduling problem and proposes a hybrid
(HES-IG) algorithm that utilizes makespan as the objective function. To address the …

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 …

As increasingly diverse tasks are being processed on single multi-functional machine,
production scheduling has become a critical issue in the planning and management of …