A Genetic Algorithm for the Single Machine Maximum Lateness Problem
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.
|Date of creation:||Sep 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Hoveniersberg 4, B-9000 Gent|
Phone: ++ 32 (0) 9 264 34 61
Fax: ++ 32 (0) 9 264 35 92
Web page: http://www.ugent.be/eb
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:09/613. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Nathalie Verhaeghe)
If references are entirely missing, you can add them using this form.