IDEAS home Printed from
   My bibliography  Save this paper

A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family


  • V. SELS





We consider the problem of scheduling a number of jobs, each job having a release time, a processing time, a due date and a family setup time, on a single machine with the objective of minimizing the maximum lateness. We develop a hybrid genetic algorithm and validate its performance on a newly developed diverse data set. We perform an extensive study of local search algorithms, based on the trade-off between the intensification and diversification strategies, taking the characteristics of the problem into account. We combine different local search neighborhoods in an intelligent manner to further improve the solution quality. We use the hybrid genetic algorithm to perform a comprehensive analysis of the influence of the different problem parameters on the maximum lateness value and the solution quality.

Suggested Citation

  • V. Sels & M. Vanhoucke, 2011. "A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 11/715, Ghent University, Faculty of Economics and Business Administration.
  • Handle: RePEc:rug:rugwps:11/715

    Download full text from publisher

    File URL:
    Download Restriction: no

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:rug:rugwps:11/715. 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). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.