Resource allocation by means of project networks: Complexity results

DOI10.1002/net.20415zbMath1230.90092MaRDI QIDQ3113509

R. Roel Leus

Publication date: 18 January 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20415

zbMATH Keywords

complexity; project scheduling; resource allocation; resource constraints

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations, Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem

Cites Work

• Schedule-induced posets
• One-machine rescheduling heuristics with efficiency and stability as criteria
• The construction of stable project baseline schedules
• Executing production schedules in the face of uncertainties: a review and some future directions
• Resource allocation by means of project networks: Dominance results
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item