IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-20430-7_30.html
   My bibliography  Save this book chapter

A Matheuristic Based on Column Generation for Parallel Machine Scheduling with Sequence Dependent Setup Times

In: Computational Management Science

Author

Listed:
  • Filipe Alvelos

    (Universidade do Minho)

  • Manuel Lopes

    (Polytechnic of Porto)

  • Henrique Lopes

    (Universidade do Minho)

Abstract

In this paper we propose a heuristic approach based on column generation (CG) and a general purpose integer programming (GPIP) solver to address a scheduling problem. The problem consists in scheduling independent jobs with given processing times on unrelated parallel machines with sequence-dependent setup times. The objective is to minimize the total weighted tardiness. The proposed matheuristic (MH) takes advantage of the efficiency of CG to define a (restricted) search space which is explored by a GPIP solver. In different iterations, different additional constraints are introduced in CG, allowing the definition of several (restricted) search spaces to be explored by the GPIP solver. Computational results show that the proposed MH can be used to tackle very large instances (e.g. 100 machines and 400 jobs) obtaining better solutions in less time than a state-of-the-art branch-and-price algorithm from the literature.

Suggested Citation

  • Filipe Alvelos & Manuel Lopes & Henrique Lopes, 2016. "A Matheuristic Based on Column Generation for Parallel Machine Scheduling with Sequence Dependent Setup Times," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 233-238, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-20430-7_30
    DOI: 10.1007/978-3-319-20430-7_30
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    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:spr:lnechp:978-3-319-20430-7_30. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.