DocumentCode
1673418
Title
A Genetic Algorithm For A Bicriteria Flexible Job Shop Scheduling Problem
Author
Vilcot, Geoffrey ; Billaut, Jean-Charles ; Esswein, Carl
Author_Institution
Volume Software, Tours
Volume
2
fYear
2006
Firstpage
1240
Lastpage
1244
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
Keywords
Pareto optimisation; benchmark testing; genetic algorithms; job shop scheduling; search problems; Pareto front; benchmark instances; flexible job shop scheduling problem; genetic algorithm; tabu search algorithm; Benchmark testing; Evolutionary computation; Fuzzy logic; Genetic algorithms; Glass; Heuristic algorithms; Job shop scheduling; Optimization methods; Time measurement; Vectors; Bicriteria; Flexible Job Shop; Genetic algorithm; Scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Systems and Service Management, 2006 International Conference on
Conference_Location
Troyes
Print_ISBN
1-4244-0450-9
Electronic_ISBN
1-4244-0451-7
Type
conf
DOI
10.1109/ICSSSM.2006.320686
Filename
4114668
Link To Document