Ghent University Academic Bibliography

Advanced

A hybrid dual-population genetic algorithm for the single machine maximum lateness problem

Veronique Sels UGent and Mario Vanhoucke UGent (2011) LECTURE NOTES IN COMPUTER SCIENCE. 6622. p.14-25
abstract
We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem specific characteristics into account can be seen as a stimulator to add diversity in the search process, which has a positive influence on the important balance between intensification and diversification. Based on a comprehensive literature study on genetic algorithms in single machine scheduling, a fair comparison of genetic operators was made.
Please use this url to cite or link to this publication:
author
organization
year
type
conference
publication status
published
subject
keyword
MINIMIZE, SEQUENCING PROBLEM, BRANCH, TIMES, Single machine scheduling, maximum lateness, genetic algorithm, dual-population structure
in
LECTURE NOTES IN COMPUTER SCIENCE
Lect. Notes Comput. Sci.
editor
Peter Merz and Jin-Kao Hao
volume
6622
issue title
Evolutionary computation in combinatorial optimization
pages
14 - 25
publisher
Springer-Verlag
place of publication
Berlin, Germany
conference name
11th European Conference on Evolutionary Computation in Combinatorial Optimization
conference location
Torino, Italy
conference start
2011-04-27
conference end
2011-04-29
Web of Science type
Proceedings Paper
Web of Science id
000301803200002
ISSN
0302-9743
ISBN
9783642203633
DOI
10.1007/978-3-642-20364-0_2
language
English
UGent publication?
yes
classification
P1
copyright statement
I have transferred the copyright for this publication to the publisher
id
1896263
handle
http://hdl.handle.net/1854/LU-1896263
date created
2011-09-01 11:13:16
date last changed
2012-06-21 09:30:03
@inproceedings{1896263,
  abstract     = {We consider the problem of scheduling a number of jobs, each job having a release time, a processing time and a due date, on a single machine with the objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem specific characteristics into account can be seen as a stimulator to add diversity in the search process, which has a positive influence on the important balance between intensification and diversification. Based on a comprehensive literature study on genetic algorithms in single machine scheduling, a fair comparison of genetic operators was made.},
  author       = {Sels, Veronique and Vanhoucke, Mario},
  booktitle    = {LECTURE NOTES IN COMPUTER SCIENCE},
  editor       = {Merz, Peter  and Hao, Jin-Kao },
  isbn         = {9783642203633},
  issn         = {0302-9743},
  keyword      = {MINIMIZE,SEQUENCING PROBLEM,BRANCH,TIMES,Single machine scheduling,maximum lateness,genetic algorithm,dual-population structure},
  language     = {eng},
  location     = {Torino, Italy},
  pages        = {14--25},
  publisher    = {Springer-Verlag},
  title        = {A hybrid dual-population genetic algorithm for the single machine maximum lateness problem},
  url          = {http://dx.doi.org/10.1007/978-3-642-20364-0\_2},
  volume       = {6622},
  year         = {2011},
}

Chicago
Sels, Veronique, and Mario Vanhoucke. 2011. “A Hybrid Dual-population Genetic Algorithm for the Single Machine Maximum Lateness Problem.” In Lecture Notes in Computer Science, ed. Peter Merz and Jin-Kao Hao, 6622:14–25. Berlin, Germany: Springer-Verlag.
APA
Sels, V., & Vanhoucke, M. (2011). A hybrid dual-population genetic algorithm for the single machine maximum lateness problem. In P. Merz & J.-K. Hao (Eds.), LECTURE NOTES IN COMPUTER SCIENCE (Vol. 6622, pp. 14–25). Presented at the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, Berlin, Germany: Springer-Verlag.
Vancouver
1.
Sels V, Vanhoucke M. A hybrid dual-population genetic algorithm for the single machine maximum lateness problem. In: Merz P, Hao J-K, editors. LECTURE NOTES IN COMPUTER SCIENCE. Berlin, Germany: Springer-Verlag; 2011. p. 14–25.
MLA
Sels, Veronique, and Mario Vanhoucke. “A Hybrid Dual-population Genetic Algorithm for the Single Machine Maximum Lateness Problem.” Lecture Notes in Computer Science. Ed. Peter Merz & Jin-Kao Hao. Vol. 6622. Berlin, Germany: Springer-Verlag, 2011. 14–25. Print.