IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-33768-5_7.html
   My bibliography  Save this book chapter

Lower Bounds for Resource Constrained Project Scheduling Problem

In: Perspectives in Modern Project Scheduling

Author

Listed:
  • Emmanuel Néron

    (LI, Université François-Rabelais de Tours)

  • Christian Artigues

    (Université d’Avignon el des Pays de Vaucluse
    Université de Montréal)

  • Philippe Baptiste

    (Ecole Polytechnique)

  • Jacques Carlier

    (CNRS HeuDiaSyC, Université de Technologie de Compiègne)

  • Jean Damay

    (Université Blaise Pascal)

  • Sophie Demassey

    (Université de Montréal)

  • Philippe Laborie

    (Ilog France)

Abstract

We review the most recent lower bounds for the makespan minimization variant of the Resource Constrained Project Scheduling Problem. Lower bounds are either based on straight relaxations of the problems (e.g., single machine, parallel machine relaxations) or on constraint programming and/or linear programming formulations of the problem.

Suggested Citation

  • Emmanuel Néron & Christian Artigues & Philippe Baptiste & Jacques Carlier & Jean Damay & Sophie Demassey & Philippe Laborie, 2006. "Lower Bounds for Resource Constrained Project Scheduling Problem," International Series in Operations Research & Management Science, in: Joanna Józefowska & Jan Weglarz (ed.), Perspectives in Modern Project Scheduling, chapter 0, pages 167-204, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-33768-5_7
    DOI: 10.1007/978-0-387-33768-5_7
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Arkhipov, Dmitry & Battaïa, Olga & Lazarev, Alexander, 2019. "An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 35-44.

    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:isochp:978-0-387-33768-5_7. 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.