Minimizing Resource Availability Costs in Time-Limited Project Networks

Erik Demeulemeester
Additional contact information
Erik Demeulemeester: Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Naamsestraat 69, B-3000 Leuven, Belgium

Management Science, 1995, vol. 41, issue 10, 1590-1598

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.

Keywords: project management; resource availability; programming; branch-and-bound; networks/graphis; applications (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.41.10.1590 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:41:y:1995:i:10:p:1590-1598

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().