OPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFIC
From MaRDI portal
Publication:2875236
DOI10.1017/S0269964814000011zbMath1302.90047MaRDI QIDQ2875236
Yasutaka Hirasawa, Vidyadhar G. Kulkarni, Nelson Lee
Publication date: 14 August 2014
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic server allocation for unstable queueing networks with flexible servers
- Refining diffusion approximations for queues
- Design of manufacturing systems using queueing models
- A generalized linear programming model for nurse scheduling
- Identifying Good Nursing Levels: A Queuing Approach
- Nurse Staffing in Medical Units: A Queueing Perspective
- Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing
- Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems
- Service-Level Differentiation in Call Centers with Fully Flexible Servers
- The Frequency Count of a Markov Chain and the Transition to Continuous Time
- Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method
- A Statistical Framework of Optimal Workload Consolidation With Application to Capacity Planning for On-Demand Computing
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Asymptotically Optimal Routing and Servive Rate Allocation in a Multiserver Queueing System
- Single-server queue with Markov-dependent inter-arrival and service times
This page was built for publication: OPTIMAL STATIC ASSIGNMENT AND ROUTING POLICIES FOR SERVICE CENTERS WITH CORRELATED TRAFFIC
