Resource constrained scheduling simulation model for alternative stochastic network projects

Dimitri Golenko-Ginzburg, Aharon Gonik and Zohar Laslo

Mathematics and Computers in Simulation (MATCOM), 2003, vol. 63, issue 2, 105-117

Abstract: The paper presents a heuristic for resource constrained network project scheduling. A network project comprising both alternative deterministic decision nodes and alternative branching nodes with probabilistic outcomes is considered. Several renewable activity related resources, such as machines and manpower, are imbedded in the model. Each type of resource is in limited supply with a resource limit that is fixed at the same level throughout the project duration. Each activity in the project requires resources of various types with fixed capacities. The activity duration is a random variable with given density function.

Keywords: Alternative decision nodes; Probabilistic branching; Joint variant; Renewable resources; Resource constrained GERT project scheduling algorithm; Stochastic project simulation (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475403000508
Full text for ScienceDirect subscribers only

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:eee:matcom:v:63:y:2003:i:2:p:105-117

DOI: 10.1016/S0378-4754(03)00050-8

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().