Resource allocation for a stochastic CPM-type network through perturbation analysis
From MaRDI portal
Publication:1342063
DOI10.1016/0377-2217(94)90355-7zbMath0815.90071MaRDI QIDQ1342063
Publication date: 13 July 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90355-7
simulation; project management; allocation; expected length of a stochastic CPM-type network; steepest descent gradient search
90B15: Stochastic network models in operations research
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Project bidding under deterministic and probabilistic activity durations
- Consistency of infinitesimal perturbation analysis estimators with rates
- Derivatives of the expected delay in the GI/G/1 Queue
- Convergence of parameter sensitivity estimates in a stochastic experiment
- Bounding the Project Completion Time Distribution in PERT Networks
- Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
- Planning Queueing Simulations