Robust resource allocations in temporal networks

DOI10.1007/s10107-011-0478-7zbMath1262.90031MaRDI QIDQ715076

Berc Rustem, Daniel Kuhn, Wolfram Wiesemann

Publication date: 15 October 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.2803

zbMATH Keywords

robust optimisation; temporal networks; resource allocation problem

Mathematics Subject Classification ID

90C25: Convex programming

90B15: Stochastic network models in operations research

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Uses Software

• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• On criticality and sensitivity in activity networks
• Uncertain convex programs: randomized solutions and confidence levels
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Multi-resource allocation in stochastic project scheduling
• A survey of scheduling with controllable processing times
• Rangen: A random network generator for activity-on-the-node networks
• Tractable approximations to robust conic optimization problems
• A class of stochastic programs with decision dependent uncertainty
• A Network Flow Computation for Project Cost Curves
• Semi-Infinite Programming: Theory, Methods, and Applications
• Convex majorization with an application to the length of critical paths
• Critical-Path Planning and Scheduling: Mathematical Basis
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• A Robust Optimization Perspective on Stochastic Programming
• A Linear Decision-Based Approximation Approach to Stochastic Programming
• The stochastic time–cost tradeoff problem: A robust optimization approach
• Two-Stage Robust Network Design with Exponential Scenarios
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS
• Robust Optimization of Large-Scale Systems
• Bounds on Expected Project Tardiness
• Application of a Technique for Research and Development Program Evaluation
• Robust Optimization for Empty Repositioning Problems
• Robust capacity expansion of network flows
• Digital Circuit Optimization via Geometric Programming
• Robust Combinatorial Optimization with Exponential Scenarios
• Introduction to global optimization.
• On the complexity of a class of combinatorial optimization problems with uncertainty
• A computational study on bounding the makespan distribution in stochastic project networks