Configuration balancing for stochastic requests

DOI10.1007/978-3-031-32726-1_10zbMath1528.90112arXiv2208.13702OpenAlexW4377199988MaRDI QIDQ6085995

Nicole Megow, Benjamin Moseley, Anupam Gupta, Franziska Eberle, Rudy Zhou

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.13702

zbMATH Keywords

stochastic schedulingload balancingstochastic routing

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• An approximation algorithm for the generalized assignment problem
• Linear Programming under Uncertainty
• How the Experts Algorithm Can Help Solve LPs Online
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
• Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization
• Approximation in stochastic scheduling
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Oblivious routing in directed graphs with random demands
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Allocating Bandwidth for Bursty Connections
• Tight Bounds for Online Vector Scheduling
• The stochastic single resource service-provision problem
• On-Line Load Balancing for Related Machines
• Stochastic Load Balancing on Unrelated Machines
• Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms
• Online load balancing on related machines
• Stochastic ℓ_p Load Balancing and Moment Problems via the L-Function Method
• Fast Algorithms for Online Stochastic Convex Programming
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Bounds on Multiprocessing Timing Anomalies
• Restricted Adaptivity in Stochastic Scheduling

This page was built for publication: Configuration balancing for stochastic requests