Resource allocation via dynamic programming in activity networks

DOI10.1016/0377-2217(93)90177-OzbMath0769.90049MaRDI QIDQ2366080

Salah E. Elmaghraby

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

resource allocationactivity networksproject completion time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

A stochastic model to control project duration and expenditure ⋮ A reduction tree approach for the discrete time/cost trade-off problem ⋮ Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks ⋮ Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach ⋮ Resource planning strategies for healthcare systems during a pandemic ⋮ The discrete time-cost tradeoff problem revisited ⋮ A multi-objective resource allocation problem in dynamic PERT networks ⋮ Time-cost trade-off via optimal control theory in Markov PERT networks ⋮ A multi-objective resource allocation problem in PERT networks ⋮ A review of the contribution of operational research to project management ⋮ A new path-based cutting plane approach for the discrete time-cost tradeoff problem ⋮ A genetic algorithm approach for the time-cost trade-off in PERT networks

Cites Work

• A Network Flow Computation for Project Cost Curves
• The Recognition of Series Parallel Digraphs
• A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
• A characterization of network representable polymatroids
• Critical Path Problems with Concave Cost-Time Curves
• Unnamed Item
• Unnamed Item
• Unnamed Item