A Tabu Search Algorithm For Solving A Bicriteria Flexible Job Shop Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A Tabu Search Algorithm For Solving A Bicriteria Flexible Job Shop Scheduling Problem

Résumé

This paper deals with a general job shop scheduling problem with multiple constraints, coming from printing and boarding industry. The objective is the minimization of two criteria, the makespan and the maximum lateness, and we are interested in finding an approximation of the Pareto frontier. We propose a fast and elitist genetic algorithm based on NSGA-II for solving the problem. The initial population of this algorithm is either randomly generated or partially generated by using a tabu search algorithm, that minimizes a linear combination of the two criteria. Both the genetic and the tabu search algorithms are tested on benchmark instances from flexible job shop literature and computational results show the interest of both methods to obtain an efficient and effective resolution method.
Fichier non déposé

Dates et versions

hal-01025533 , version 1 (18-07-2014)

Identifiants

  • HAL Id : hal-01025533 , version 1

Citer

Geoffrey Vilcot, Jean-Charles Billaut, Carl Esswein. A Tabu Search Algorithm For Solving A Bicriteria Flexible Job Shop Scheduling Problem. 12th IFAC Symposium on Information Control Problems in Manufacturing, May 2006, Saint-Etienne, France. pp.57-62. ⟨hal-01025533⟩
17 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More