Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory

Eduardo Lalla-Ruiz, Stefan Voß

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

    Abstract

    Minimizing total tardiness on identical parallel machines is an NP-hard parallel machine scheduling problem that has received much attention in literature due to its direct application to real-world applications. For solving this problem, we present a variable neighbourhood search that incorporates a learning mechanism for guiding the search. Computational results comparing with the best approaches for this problem reveals that our algorithm is a suitable alternative to efficiently solve this problem.
    Original languageEnglish
    Title of host publicationLearning and Intelligent Optimization
    Subtitle of host publication9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers
    EditorsClarisse Dhaenens, Laetitia Jourdan, Marie-Eléonore Marmion
    Place of PublicationCham
    PublisherSpringer
    Pages119-124
    Number of pages6
    ISBN (Electronic)978-3-319-19084-6
    ISBN (Print)978-3-319-19083-9
    DOIs
    Publication statusPublished - 29 May 2015
    Event9th International Conference on Learning and Intelligent Optimization, LION 2015 - Lille, France
    Duration: 12 Jan 201515 Jan 2015
    Conference number: 9

    Publication series

    NameLecture Notes in Computer Science
    Volume8994
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference9th International Conference on Learning and Intelligent Optimization, LION 2015
    Abbreviated titleLION
    CountryFrance
    CityLille
    Period12/01/1515/01/15

    Fingerprint Dive into the research topics of 'Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning Memory'. Together they form a unique fingerprint.

    Cite this