Multi-objective Path Relinking Algorithm for Solving Bi-objective Flowshop Scheduling Problem

This paper deals with a bi-objective flowshop scheduling problem, where the objective functions are to minimize the total completion time and the total tardiness. The path relinking techniques are integrated into hypervolume-based multi-objective optimization. Thus, a simple and effective multi-objective path relinking algorithm is proposed to find a locally Pareto-optimal frontier of the given problem. A set of well-known benchmark instances are carried out to evaluate the algorithms. The computational results show that our proposed algorithm is very competitive comparing with the indicator-based multi-objective algorithms.