Resource Allocation in Activity Networks under Stochastic Conditions. A Geometric Programming-Sample Path Optimization Approach
We depart from the conventional ‘resource constrained project scheduling problem’, better known under the acronym RCPSP, by adding the element of randomness to the activities. In particular, we assume that each activity in the project has a work content that is exponentially distributed. The duration of an activity is then modeled as a function of the random work content and the allocated resources; the exact functional relationship can be arbitrarily defined. The stochastic optimization problem is approached by a method that is a ‘marriage’ between geometric programming (GP) and sample path optimization (SPO) that is flexible and can be implemented in a modular fashion.
Volume (Year): LII (2007)
Issue (Month): 3 ()
|Contact details of provider:|| Postal: Naamsestraat 69, 3000 Leuven|
Web page: http://feb.kuleuven.be/rebel
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ete:revbec:20070303. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (library EBIB)
If references are entirely missing, you can add them using this form.