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

Rolf H. Möhring
Additional contact information
Rolf H. Möhring: Technical University of Aachen, Aachen, West Germany

Operations Research, 1984, vol. 32, issue 1, 89-120

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.

Keywords: 581 scheduling under precedence constraints; 671 minimizing resource requirements in project networks (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.1.89 (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:oropre:v:32:y:1984:i:1:p:89-120

Access Statistics for this article

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