IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

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

Listed author(s):
  • V. SELS




Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Paper provided by Ghent University, Faculty of Economics and Business Administration in its series Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium with number 11/715.

    in new window

    Length: 2 pages
    Date of creation: Apr 2011
    Handle: RePEc:rug:rugwps:11/715
    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:

    More information through EDIRC

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.