Multi-resource allocation in stochastic project scheduling

DOI10.1007/s10479-008-0486-zzbMath1254.90080MaRDI QIDQ1931636

Wolfram Wiesemann, Daniel Kuhn, Berc Rustem

Publication date: 15 January 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0486-z

zbMATH Keywords

project scheduling; value-at-risk; resource allocation problem

Mathematics Subject Classification ID

90B36: Stochastic scheduling theory in operations research

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

Related Items

Ambiguous Joint Chance Constraints Under Mean and Dispersion Information, Robust resource allocations in temporal networks, Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times, Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
• Sample average approximation of expected value constrained stochastic programs
• Convexity of chance constraints with independent random variables
• A class of stochastic programs with decision dependent random elements
• Second-order cone programming
• Project scheduling. A research handbook.
• Improving project cost estimation by taking into account managerial flexibility
• Uncertain convex programs: randomized solutions and confidence levels
• Project scheduling under uncertainty: survey and research potentials
• Deterministic job-shop scheduling: Past, present and future
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• On two-stage convex chance constrained problems
• Tractable approximations to robust conic optimization problems
• A class of stochastic programs with decision dependent uncertainty
• A central limit theorem for m-dependent random variables with unbounded m
• Coherent Measures of Risk
• Robust Convex Optimization
• A Network Flow Computation for Project Cost Curves
• Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management
• Critical-Path Planning and Scheduling: Mathematical Basis
• A Robust Optimization Perspective on Stochastic Programming
• The stochastic time–cost tradeoff problem: A robust optimization approach
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• A Random Activity Network Generator
• The Scenario Approach to Robust Control Design
• Ambiguity in portfolio selection
• Convex Approximations of Chance Constrained Programs
• Nonlinear Programming
• Introduction to global optimization.