Genetic Algorithms for Bi-Objective Job Shop Scheduling Problem

Abstract

This article considers the bi-objective job shop scheduling problem in which the make span and the total tardiness of jobs are minimized. In order to find a set of dominant solutions, that is, an approximation of the Pareto optimal solutions, we propose three versions of a genetic algorithm with techniques like hybridization with local search, path relinking and elitism. The three versions of the algorithm are compared with each other and they are also compared with other multiobjective genetic algorithm proposed in the literature.