Modelling a Novel Multi-Objective Open-Shop Scheduling Problem and Solving by a Scatter Search Method

This paper proposes a novel, multi-objective integer programming model for an open-shop scheduling problem (OSSP). Three objectives are to minimize the makespan, total job tardiness and earliness, and total jobs setup cost. Due the complexity to solve such a hard problem, we develop a meta-heuristic algorithm based on multiobjective scatter search (MOSS), and a number of test problems are solved by this proposed algorithm. Finally, to prove its efficiency, the related results are compared with the results obtained by the wellknown multi-objective evolutionary algorithm, called NSGA-II. The results confirm the efficiency and the effectiveness of our proposed MOSS to provide good solutions, especially for medium and largesized problems.