A simple dynamic routing problem
From MaRDI portal
Publication:3898316
DOI10.1109/TAC.1980.1102445zbMath0451.90060MaRDI QIDQ3898316
Anthony Ephremides, Jean Walrand, Pravin P. Varaiya
Publication date: 1980
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items
Improving routing decisions in parallel non-observable queues ⋮ Multiscale Q-learning with linear function approximation ⋮ Optimal QoS control of interacting service stations ⋮ Insensitive versus efficient dynamic load balancing in networks without blocking ⋮ On the waiting time of arriving aircrafts and the capacity of airports with one or two runways ⋮ On computing average cost optimal policies with application to routing to parallel queues ⋮ Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives ⋮ Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing ⋮ Martingale dynamics and optimal routing in a network ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ Optimal control of multiclass parallel service systems ⋮ Self-Learning Threshold-Based Load Balancing ⋮ Optimality of the shortest line discipline with state-dependent service rates ⋮ Approximating the mean response time of parallel queues with JSQ policy ⋮ Sample path methods in the control of queues ⋮ Understanding the marginal impact of customer flexibility ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Zero-wait load balancing with sparse messaging ⋮ Steady-state analysis of shortest expected delay routing ⋮ Routing jobs with deadlines to heterogeneous parallel servers ⋮ Cost-aware defense for parallel server systems against reliability and security failures ⋮ Optimal Routing of Fixed Size Jobs to Two Parallel Servers ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems ⋮ Open Problem—Load Balancing Using Delayed Information ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ On the optimality of semidynamic routing schemes ⋮ To split or not to split: selecting the right server with batch arrivals ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Optimal dynamic load distribution in a class of flow-type flexible manufacturing systems ⋮ Monotonicity properties of cost functions in queueing networks ⋮ A game theoretic perspective to flow control in telecommunication networks ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ On the average optimality of circular assignment policy ⋮ On-line scheduling of a robotic manufacturing cell with stochastic sequence-dependent processing rates ⋮ Optimal inspection policies for a manufacturing station ⋮ Multi-layered round robin routing for parallel servers ⋮ Task allocation in multiserver systems -- a survey of results. ⋮ Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling ⋮ A survey of Markov decision models for control of networks of queues ⋮ Job assignment in large-scale service systems with affinity relations ⋮ Analysis of the shortest relay queue policy in a cooperative random access network with collisions ⋮ Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems ⋮ Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Multiple-server system with flexible arrivals ⋮ Dynamic Scheduling of a Four-Station Queueing Network ⋮ On the Optimality of the Generalized Shortest Queue Policy ⋮ On the Shortest Queue Policy for the Tandem Parallel Queue ⋮ Convexity and characterization of optimal policies in a dynamic routing problem ⋮ CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS ⋮ Partial Flexibility in Routeing and Scheduling ⋮ Signaling for decentralized routing in a queueing network ⋮ Formation and dynamic routeing of part families among flexible manufacturing cells ⋮ Control of arrivals to two queues in series ⋮ Optimization of static traffic allocation policies ⋮ Optimal dynamic routing in Markov queueing networks
