[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v38y1992i12p1803-1818.html
   My bibliography  Save this article

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

Author

Listed:
  • Erik Demeulemeester

    (Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Dekenstraat 2, B-3000 Leuven, Belgium)

  • Willy Herroelen

    (Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Dekenstraat 2, B-3000 Leuven, Belgium)

Abstract
In this paper a branch-and-bound procedure is described for scheduling the activities of a project of the PERT/CPM variety subject to precedence and resource 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. Precedence and resource-based bounds described in the paper are combined with new dominance pruning rules to rapidly fathom major portions of the solution tree. The procedure is programmed in the C language for use on both a mainframe and a personal computer. The procedure has been validated using a standard set of test problems with between 7 and 50 activities requiring up to three resource types each. Computational experience on a personal computer indicates that the procedure is 11.6 times faster than the most rapid solution procedure reported in the literature while requiring less computer storage. Moreover, problems requiring large amounts of computer time using existing approaches for solving this problem type are rapidly solved with our procedure using the dominance rules described, resulting in a significant reduction in the variability in solution times as well.

Suggested Citation

  • Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    • Handle: RePEc:inm:ormnsc:v:38:y:1992:i:12:p:1803-1818
    DOI: 10.1287/mnsc.38.12.1803
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.38.12.1803
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.38.12.1803?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
    ---><---

    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:ormnsc:v:38:y:1992:i:12:p:1803-1818. 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.