IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v41y1995i10p1590-1598.html
   My bibliography  Save this article

Minimizing Resource Availability Costs in Time-Limited Project Networks

Author

Listed:
  • Erik Demeulemeester

    (Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium)

Abstract

We consider the problem of minimizing renewable resource availability costs in an activity-on-the-node project network subject to a project due date. Project activities have fixed durations and may require the use of multiple renewable resources in constant amounts throughout their duration. Various assumptions may be made about the type of precedence relations, ready times, due dates, and task interruptability. Given a discrete, non-decreasing cost function of the constant resource availability for every resource type, the objective is to determine the resource availability levels in order to minimize the sum of the availability costs over all resource types. An effective optimal algorithm is described and extensive computational experience is reported.

Suggested Citation

  • Erik Demeulemeester, 1995. "Minimizing Resource Availability Costs in Time-Limited Project Networks," Management Science, INFORMS, vol. 41(10), pages 1590-1598, October.
    • Handle: RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1590-1598
    DOI: 10.1287/mnsc.41.10.1590
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.41.10.1590
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.41.10.1590?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:41:y:1995:i:10:p:1590-1598. 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.