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

Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time

Author

Listed:
  • Rolf H. Möhring

    (Technical University of Aachen, Aachen, West Germany)

Abstract

We consider the problem of minimizing the resource costs in a project network N o subject to a time limit for the completion of N o , when resource requirements per activity and costs for obtaining resources are independent of time. Our results show that the optimum is determined for all possible resource requirements and costs by certain sets of “feasible structures,” which are networks that extend the precedence relation of N o and respect the given time limit. We characterize the least such sets, and give methods for determining them as well as for determining the optimum. Furthermore, we establish duality relations with the problem of scarce resources (minimizing project duration subject to limited resources) and characterize all “essentially different” problems.

Suggested Citation

  • Rolf H. Möhring, 1984. "Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time," Operations Research, INFORMS, vol. 32(1), pages 89-120, February.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:1:p:89-120
    DOI: 10.1287/opre.32.1.89
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.1.89
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.1.89?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. C-C Hsu & D S Kim, 2005. "A new heuristic for the multi-mode resource investment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 406-413, April.
    2. Moehring, Rolf & Uetz, Marc & Stork, Frederik & Schulz, Andreas S., 2002. "Solving Project Scheduling Problems by Minimum Cut," Working papers 4231-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.

    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:32:y:1984:i:1:p:89-120. 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.