IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1996016.html
   My bibliography  Save this paper

A Time-Indexed Formulation for Single-Machine Scheduling Problems : Branch-and-Cut

Author

Listed:
  • van den AKKER, Janna M.

    (Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium)

  • HURKENS, C.A.J.

    (Department of Mathematics and Computing Science, Eindhoven University of Technology, EIndhoven, The Netherlands)

  • SAVELSBERGH, M.W.P.

    (School of Industrial ans Systems Engineering, Georgia Institute of Technology, Atlanta)

Abstract

In Van den Akker, Va, Hoesel, and Savelsbergh [1994], we have studied a tume-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand side 1 and 2 for the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm based on these facet inducing inequalities. We describe separation algorithms for each class of these inequalities, and elaborate on various other important components of the branch-and-cut algorithm, such as branching strategies, cut generation schemes, and primal heuristics. We present our computational experiences with the algorithm for the problem of minimizing the total weighted completion time on a single machine subject to release dates.

Suggested Citation

  • van den AKKER, Janna M. & HURKENS, C.A.J. & SAVELSBERGH, M.W.P., 1996. "A Time-Indexed Formulation for Single-Machine Scheduling Problems : Branch-and-Cut," LIDAM Discussion Papers CORE 1996016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1996016
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1996.html
    Download Restriction: no
    ---><---

    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:cor:louvco:1996016. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.