Solving an Open Shop Scheduling Problem by a Novel Hybrid Multi-Objective Ant Colony Optimization

This paper considers an open shop scheduling problem that minimizes bi-objectives, namely makespan and total tardiness. This problem, due to its complexity, is ranked in the class of NP-hard problems. In this case, traditional approaches cannot reach to an optimal solution in a reasonable time. Thus, we propose an efficient method based on multi-objective simulated annealing and ant colony optimization, in order to solve the given problem. Finally, we compare our computational results with a well-known multi-objective genetic algorithm, namely NSGA II. Comparisons are made in single objective case too. The outputs show the encouraging results in the form of the solution quality.