Open-loop routing of N arrivals to M parallel queues

DOI10.1109/9.478334zbMATH Open0845.90054OpenAlexW2154195901MaRDI QIDQ4875989FDOQ4875989

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

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

zbMATH Keywords

routingpolicy iterationqueues in parallel

Mathematics Subject Classification ID

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

Cited In (6)

• Improving routing decisions in parallel non-observable queues
• Optimal routing in two parallel queues with exponential service times
• 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
• Open-loop routeing to M parallel servers with no buffers

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)