A Genetic Algorithm for the Single Machine Maximum Lateness Problem

V. Sels () and Mario Vanhoucke

Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium from Ghent University, Faculty of Economics and Business Administration

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 or tardiness. This problem often occurs as a sub-problem in solving other scheduling environments such as flow shops or job shops. We developed a genetic algorithm and compared its performance with alternative methods on diverse data sets. Based on a literature study on genetic algorithms in single machine scheduling, a fair comparison of genetic operators was made. We performed an extensive study of local search algorithms, based on the trade-off between the intensification and diversification strategy. Computational results further revealed that combining different neighborhoods in an intelligent manner can remarkably improve the solution quality.

Pages: 2 pages
Date: 2009-09
New Economics Papers: this item is included in nep-cmp
References: Add references at CitEc
Citations:

Downloads: (external link)
http://wps-feb.ugent.be/Papers/wp_09_613.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rug:rugwps:09/613

Access Statistics for this paper

More papers in Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium from Ghent University, Faculty of Economics and Business Administration Contact information at EDIRC.
Bibliographic data for series maintained by Nathalie Verhaeghe ().