Configuration balancing for stochastic requests

DOI10.1007/S10107-024-02132-WMaRDI QIDQ7019070zbMATH OpenFDO

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

Publication date 5 March 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02132-W

zbMATH Keywords

load balancingstochastic routingstochastic schedulingunrelated machines

Mathematics Subject Classification ID

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

Cites work

• A dynamic near-optimal algorithm for online linear programming
• Adaptive Bin Packing with Overflow
• Allocating Bandwidth for Bursty Connections
• An approximation algorithm for the generalized assignment problem
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for stochastic minimum-norm combinatorial optimization
• Approximation in stochastic scheduling
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Bounds on Multiprocessing Timing Anomalies
• Concentration of Measure for the Analysis of Randomized Algorithms
• Configuration balancing for stochastic requests
• Fast algorithms for online stochastic convex programming
• Greed works -- online algorithms for unrelated machine stochastic scheduling
• How the experts algorithm can help solve LPs online
• scientific article; zbMATH DE number 6677416 (Why is no real title available?)
• scientific article; zbMATH DE number 3115465 (Why is no real title available?)
• scientific article; zbMATH DE number 5485449 (Why is no real title available?)
• Improved approximation results for stochastic knapsack problems
• Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
• Linear programming under uncertainty
• Models and Algorithms for Stochastic Online Scheduling
• Oblivious routing in directed graphs with random demands
• On a routing problem
• On-Line Load Balancing for Related Machines
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Online and bandit algorithms beyond \(\ell_p\) norms
• Online load balancing on related machines
• Probability Inequalities for the Sum of Independent Random Variables
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Restricted Adaptivity in Stochastic Scheduling
• Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
• Sampling-based approximation algorithms for multistage stochastic optimization
• Stochastic _p load balancing and moment problems via the L-function method
• Stochastic load balancing on unrelated machines
• Stochastic Machine Scheduling with Precedence Constraints
• Stochastic Online Scheduling Revisited
• The Competitiveness of On-Line Assignments
• The stochastic single resource service-provision problem
• Tight bounds for online vector scheduling
• Unrelated machine scheduling with stochastic processing times

Cited in

(1)

• The power of proportional fairness for nonclairvoyant polytope scheduling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019070)