IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i2p201-212.html
   My bibliography  Save this article

A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem

Author

Listed:
  • Erik L. Demeulemeester

    (Katholieke Universiteit Leuven, Leuven, Belgium)

  • Willy S. Herroelen

    (Katholieke Universiteit Leuven, Leuven, Belgium)

Abstract

In this paper a branch-and-bound procedure is described for scheduling project activities subject to precedence diagramming type of precedence relations, ready times, due dates, and variable multiple resource availability constraints, where the objective is to minimize project duration. The procedure is based on a depth-first solution strategy in which nodes in the solution tree represent resource and precedence feasible partial schedules. Branches emanating from a parent node correspond to exhaustive and minimal combinations of activities, the delay of which resolves resource conflicts at each parent node. A precedence based lower bound and several dominance rules are introduced in order to restrict the growth of the solutions tree. The procedure has been programmed in the C language. Extensive computational experience is reported.

Suggested Citation

  • Erik L. Demeulemeester & Willy S. Herroelen, 1997. "A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem," Operations Research, INFORMS, vol. 45(2), pages 201-212, April.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:2:p:201-212
    DOI: 10.1287/opre.45.2.201
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.2.201
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.2.201?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    3. Feifei Li & Zhe Xu, 2018. "A multi-agent system for distributed multi-project scheduling with two-stage decomposition," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-24, October.
    4. Bianco, Lucio & Caramia, Massimiliano, 2012. "An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 219(1), pages 73-85.
    5. Tavares, L. V., 2002. "A review of the contribution of Operational Research to Project Management," European Journal of Operational Research, Elsevier, vol. 136(1), pages 1-18, January.
    6. Hua Wang & Jon Dieringer & Steve Guntz & Shankarraman Vaidyaraman & Shekhar Viswanath & Nikolaos H. Lappas & Sal Garcia-Munoz & Chrysanthos E. Gounaris, 2021. "Portfolio-Wide Optimization of Pharmaceutical R&D Activities Using Mathematical Programming," Interfaces, INFORMS, vol. 51(4), pages 262-279, July.
    7. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    8. Bert De Reyck & Erik Demeulemeester & Willy Herroelen, 1998. "Local search methods for the discrete time/resource trade‐off problem in project networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 553-578, September.

    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:inm:oropre:v:45:y:1997:i:2:p:201-212. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.