An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems

An Effective Constructive Heuristic for the No-wait Flowshop with Sequence- Dependent Setup times Problem

This paper presents a new heuristic named GAPH based on a structural property for minimizing makespan in no-wait flowshop with sequence-dependent setup times. Experimental results demonstrate the superiority of the proposed approach over thhree of the best-know methods in the literature. Experimental and statistical analyses show that the new heuristic provides better solutions regarding the so...

A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups

This paper studies the two-machine flowshop scheduling problem with class setups in a no-wait processing environment to minimize the maximum lateness. The jobs are divided into job classes and a setup is required at the initial processing of a job or between the processing of jobs of different classes. In a no-wait environment, a job must be processed from start to finish without interruptions ...

A Simple No - Wait Flowshop Scheduling Heuristicfor

A hybrid heuristic algorithm for the no-wait flowshop problem with sequence-dependent setup times

We consider the NP-hard no-wait flowshop scheduling problem with sequence-dependent setup times to minimize makespan. We propose a hybrid heuristic which combines the iterated greedy process with local search method based on a block swap operator. Experimental results show that the proposed heuristic is comparatively more effective than the existing metaheuristics.

An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives