Optimal allocation of servers and processing time in a load balancing system
From MaRDI portal
Publication:991378
DOI10.1016/J.COR.2010.03.007zbMath1231.90140OpenAlexW2014867996MaRDI QIDQ991378
Muhammad El-Taha, Roy Abou Tayeh, Bacel Maddah
Publication date: 7 September 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.007
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Allocation of service time in a two-server system
- On Pooling in Queueing Networks
- Technical Note—Some Simpler Bounds on the Mean Queuing Time
- Allocation of Service Time in a Multiserver System
- Task assignment with unknown duration
- Approximating a Point Process by a Renewal Process: The View Through a Queue, an Indirect Approach
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Commonalities in Reengineered Business Processes: Models and Issues
- EquiLoad: a load balancing policy for clustered web servers
- Partitioning Customers into Service Groups
This page was built for publication: Optimal allocation of servers and processing time in a load balancing system