A Genetic Algorithm For A Bicriteria Flexible Job Shop Scheduling Problem

Abstract

The problem we consider in this paper is a flexible job shop scheduling problem. The aim is to minimize two criteria: the makespan and the maximum lateness and we are interested in finding an approximation of the Pareto front. The method that we propose is a Genetic algorithm. The initial population is partially generated by using a Tabu Search algorithm which minimizes a linear combination of the two criteria. The method is tested on benchmark instances from literature.