IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-55702-1_73.html
   My bibliography  Save this book chapter

Providing Lower Bounds for the Multi-Mode Resource-Constrained Project Scheduling Problem

In: Operations Research Proceedings 2016

Author

Listed:
  • Christian Stürck

    (Helmut Schmidt University)

  • Patrick Gerhards

    (Helmut Schmidt University)

Abstract

We present lower bounds (LB) for the multi-mode resource-constrained project scheduling problem (MRCPSP). Traditionally, the LB for the MRCPSP are derived from the critical path method (CPM). Here, the mode with the shortest duration of each activity is chosen. We improve these LB. New earliest starting times (EST) are calculated by solving several integer programs with a standard solver. These new EST partially improve the EST calculated by the critical path method. This also reduces the number of variables in the model and, in the best case, proves optimality of the best known solutions. Computational results show that these new starting times provide a tighter bound than the LB obtained from CPM.

Suggested Citation

  • Christian Stürck & Patrick Gerhards, 2018. "Providing Lower Bounds for the Multi-Mode Resource-Constrained Project Scheduling Problem," Operations Research Proceedings, in: Andreas Fink & Armin Fügenschuh & Martin Josef Geiger (ed.), Operations Research Proceedings 2016, pages 551-557, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-55702-1_73
    DOI: 10.1007/978-3-319-55702-1_73
    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. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.

    More about this item

    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:spr:oprchp:978-3-319-55702-1_73. 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.