No-Wait Hybrid Flowshop Scheduling: Models and Solotion Algorithms

In this paper, hybrid flow shop scheduling problem with parallel machines in each work station is examined. This problem considered two works: no-wait restriction jobs and typical jobs. In no-wait restriction jobs, the operations must be processed with no stop. This paper mathematically formulates the problem with two different mixed integer linear models under proposed considerations. The small instances of the problem are solved and performance results are analyzsed using commercial software of mathematical programming. To solve larger instances of the problem, two solution algorithms have been developed. These two algorithms are based on imperialist competitive algorithm and simulated annealing. A comprehensive numerical experiment is conducted to evaluate algorithms. The results show that the imperialist competitive algorithm outperforms simulated annealing.