Locating and staffing service centers under service level constraints
From MaRDI portal
Publication:1044135
DOI10.1016/j.ejor.2009.02.004zbMath1177.90106MaRDI QIDQ1044135
Prahalad Venkateshan, Kamlesh Mathur, Ronald H. Ballou
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.004
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C05: Linear programming
90B22: Queues and service in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum reliability location problem and \(\alpha\)-reliable p-center problem: Derivatives of the probabilistic location set covering problem
- Location-allocation on congested networks
- The queueing maximal availability location problem: A model for the siting of emergency vehicles
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Dimensioning Large Call Centers
- Optimal Server Location on a Network Operating as an M/G/1 Queue
- Optimal 2-Facility Network Districting in the Presence of Queuing
- Approximating the Equilibrium Behavior of Multi-Server Loss Systems
- An Overview of Representative Problems in Location Research
- A location model for a facility operating as anM/G/k queue
- Approximations of the Mean Waiting Time in an M/G/s Queueing System
- Understanding the Efficiency of Multi-Server Service Systems
- Approximating the Performance of Urban Emergency Service Systems
- Some bounds for many-server systems GI/G/s
- A Diffusion Approximation for the G/GI/n/m Queue
