Many‐server loss models with non‐poisson time‐varying arrivals |
| |
| Authors: | Ward Whitt Jingtong Zhao |
| |
| Affiliation: | Department of Industrial Engineering and Operations Research, Columbia University, New York, New York |
| |
| Abstract: | This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017 |
| |
| Keywords: | nonstationary loss models staffing a service system capacity planning queues with time‐varying arrival rates modified offered load approximation non‐Poisson nonstationary arrival processes |
|
|
