DocumentCode :
685188
Title :
Resolution of the F2||Σtj scheduling problem by genetic algorithm and matheuristic
Author :
Quang Chieu, T.A. ; Wang Gen ; Billaut, Jean-Charles ; Bouquard, Jean-Louis
Author_Institution :
LI, Univ. Francois Rabelais de Tours, Tours, France
fYear :
2013
fDate :
28-30 Oct. 2013
Firstpage :
1
Lastpage :
5
Abstract :
We consider in this paper the two-machine flow-shop scheduling problem with total tardiness minimization. We propose a genetic algorithm and a matheuristic algorithm. Some computational experiments are described and the results show that these methods outperform other existing methods based on truncated branch-and-bound algorithms. Some future research directions are given, both in terms of evaluation and of resolution method.
Keywords :
flow shop scheduling; genetic algorithms; tree searching; F2||Σtj scheduling problem; computational experiments; evaluation method; genetic algorithm; matheuristic algorithm; resolution method; total tardiness minimization; truncated branch-and-bound algorithms; two-machine flow-shop scheduling problem; Computers; Genetic algorithms; Operations research; Processor scheduling; Scheduling; Sociology; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Engineering and Systems Management (IESM), Proceedings of 2013 International Conference on
Conference_Location :
Rabat
Type :
conf
Filename :
6761431
Link To Document :
بازگشت