A hybrid dual-population genetic algorithm for the single machine maximum lateness problem
- Author
- Veronique Sels (UGent) and Mario Vanhoucke (UGent)
- Organization
- 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.
- Keywords
- MINIMIZE, SEQUENCING PROBLEM, BRANCH, TIMES, Single machine scheduling, maximum lateness, genetic algorithm, dual-population structure
Downloads
-
SMS109 - Sels and Vanhoucke LNCS 2011.pdf
- full text
- |
- open access
- |
- |
- 351.14 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-1896263
- MLA
- Sels, Veronique, and Mario Vanhoucke. “A Hybrid Dual-Population Genetic Algorithm for the Single Machine Maximum Lateness Problem.” LECTURE NOTES IN COMPUTER SCIENCE, edited by Peter Merz and Jin-Kao Hao, vol. 6622, Springer-Verlag, 2011, pp. 14–25, doi:10.1007/978-3-642-20364-0_2.
- 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). https://doi.org/10.1007/978-3-642-20364-0_2
- Chicago author-date
- 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, edited by Peter Merz and Jin-Kao Hao, 6622:14–25. Berlin, Germany: Springer-Verlag. https://doi.org/10.1007/978-3-642-20364-0_2.
- Chicago author-date (all authors)
- 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 by. Peter Merz and Jin-Kao Hao, 6622:14–25. Berlin, Germany: Springer-Verlag. doi:10.1007/978-3-642-20364-0_2.
- 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.
- IEEE
- [1]V. Sels and M. Vanhoucke, “A hybrid dual-population genetic algorithm for the single machine maximum lateness problem,” in LECTURE NOTES IN COMPUTER SCIENCE, Torino, Italy, 2011, vol. 6622, pp. 14–25.
@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}}, keywords = {{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://doi.org/10.1007/978-3-642-20364-0_2}}, volume = {{6622}}, year = {{2011}}, }
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: