IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/559444.html
   My bibliography  Save this paper

A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching

Author

Listed:
  • Daniel Kowalczyk
  • Roel Leus

Abstract

We study the parallel machine scheduling problem to minimize the sum of the weighted completion times of the jobs to be scheduled (problem P m||P wjCj in the standard three-field notation). We use the set covering formulation that was introduced by van den Akker et al. (1999) for this problem, and we improve the computational performance of their branch-and-price (B&P) algorithm by a number of techniques, including a different generic branching scheme, zero-suppressed binary decision diagrams (ZDDs) to solve the pricing problem, dual-price smoothing as a stabilization method, and Farkas pricing to handle infeasibilities. We report computational results that show the effectiveness of the algorithmic enhancements, which depends on the characteristics of the instances. To the best of our knowledge, we are also the first to use ZDDs to solve the pricing problem in a B&P algorithm for a scheduling problem.

Suggested Citation

  • Daniel Kowalczyk & Roel Leus, 2016. "A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching," Working Papers of Department of Decision Sciences and Information Management, Leuven 559444, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
    • Handle: RePEc:ete:kbiper:559444
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/416717
    File Function: A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Parallel machine scheduling; Weighted completion times; Branch and price; ZDD; Stabilization;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ete:kbiper:559444. 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: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    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.