Open Problem—Load Balancing Using Delayed Information

DOI10.1287/stsy.2019.0045zbMath1446.60070OpenAlexW2973593380MaRDI QIDQ5113907

David Lipshutz

Publication date: 18 June 2020

Published in: Stochastic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/stsy.2019.0045

zbMATH Keywords

optimizationcontrolstochastic networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018 ⋮ Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information

Cites Work

• Unnamed Item
• On existence and uniqueness of stationary distributions for stochastic delay differential equations with positivity constraints
• Queueing system with selection of the shortest of two queues: An asymptotic approach
• An analysis of queues with delayed information and time-varying arrival rates
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• Queues with Choice via Delay Differential Equations
• Nonlinear Dynamics in Queueing Theory: Determining the Size of Oscillations in Queues with Delay

This page was built for publication: Open Problem—Load Balancing Using Delayed Information