Open-loop routing of N arrivals to M parallel queues

DOI10.1109/9.478334MaRDI QIDQ4875989zbMATH OpenOpenAlexFDO

Authors Rodolfo A. Milito, Emmanuel Fernández-Gaucherand

Publication date 15 September 1996

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.478334

zbMATH Keywords

policy iterationqueues in parallelrouting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4059093
• Open-loop routeing to M parallel servers with no buffers
• On the Assignment of Customers to Parallel Queues
• Individually optimal routing in parallel systems
• Optimal routing of customers with general independent interarrival times in deterministic parallel queues

Cited in

(9)

• On computing average cost optimal policies with application to routing to parallel queues
• Improving routing decisions in parallel non-observable queues
• On the Bellman's principle of optimality
• Applying reinforcement learning to basic routing problem
• Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement
• Waiting time based routing policies to parallel queues with percentiles objectives
• Adaptive Routing on the Plane
• Open-loop routeing to M parallel servers with no buffers
• Optimal routing in two parallel queues with exponential service times

This page was built for publication: Open-loop routing of N arrivals to M parallel queues

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