Resource allocation for a stochastic CPM-type network through perturbation analysis

DOI10.1016/0377-2217(94)90355-7zbMath0815.90071OpenAlexW2020761950MaRDI QIDQ1342063

Yat-Wah Wan

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

zbMATH Keywords

simulationproject managementallocationexpected length of a stochastic CPM-type networksteepest descent gradient search

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Uses Software

• GASP IV

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource allocation for a stochastic CPM-type network through perturbation analysis