No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms

This article studies a no-wait two-stage flexible flow shop scheduling problem with setup times aiming to minimize the total completion time. The problem is solved using an adaptive imperialist competitive algorithm (AICA) and genetic algorithm (GA). To test the performance of the proposed AICA and GA, the algorithms are compared with ant colony optimisation, known as an effective algorithm in the literature. The performance of the algorithms are evaluated by solving both small and large-scale problems. Their performance is evaluated in terms of relative percentage deviation. Finally the results of the study are discussed and conclusions and potential areas for further study are highlighted.