Customer routing to different servers with complete information
DOI10.2307/1427771zbMATH Open0691.60083OpenAlexW2312468516MaRDI QIDQ3033100FDOQ3033100
Authors: Zvi Rosberg, Parviz Kermani 
Publication date: 1989
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427771
Recommendations
- Optimal routing to parallel heterogeneous servers-small arrival rates
- On the Assignment of Customers to Parallel Queues
- Optimal routing to two parallel heterogeneous servers with resequencing
- Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
optimal allocation problemmatrix geometric form of the steady-state distributionsoverflow routing class
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Cited In (7)
- Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
- Title not available (Why is that?)
- Load-balancing for multi-skilled servers with Bernoulli routing
- Allocation of Servers for Stochastic Service Stations with One Overflow Station
- Optimal routing to parallel heterogeneous servers-small arrival rates
- Customer routing to parallel servers with different rates
- An overview for Markov decision processes in queues and networks
This page was built for publication: Customer routing to different servers with complete information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033100)
