A bi-objective case of no-wait flowshops

Abstract

This paper studies multi-objective no-wait flows hop scheduling problems to minimize both makespan and total tardiness. This paper mathematically formulates it as two effective multi-objective mixed integer linear programming models. The multi-objective models are then solved using a multiple criteria decision making approach. Moreover, this paper proposes a novel multi-objective iterated local search algorithm incorporating with three types of local search engine, greedy and moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against some available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.