Many-server scaling of the N-system under FCFS–ALIS
Open Access
- 9 October 2017
- journal article
- research article
- Published by Springer Nature in Queueing Systems
- Vol. 88 (1-2) , 27-71
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Israel Science Foundation grants (711/09 and 286/13)
This publication has 20 references indexed in Scilit:
- A Skill Based Parallel Service System Under FCFS-ALIS — Steady State, Overloads, and AbandonmentsStochastic Systems, 2014
- Dynamic Scheduling of a Two-Server Parallel Server System with Complete Resource Pooling and Reneging in Heavy Traffic: Asymptotic Optimality of a Two-Threshold PolicyMathematics of Operations Research, 2013
- Exact FCFS Matching Rates for Two Infinite Multitype SequencesOperations Research, 2012
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server SystemsOperations Research, 2010
- Exact asymptotics for the stationary distribution of a Markov chain: a production modelQueueing Systems, 2009
- Queue-and-Idleness-Ratio Controls in Many-Server Service SystemsMathematics of Operations Research, 2009
- Fcfs infinite bipartite matching of servers and customersAdvances in Applied Probability, 2009
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policyThe Annals of Applied Probability, 2001
- On the stability of a partially accessible multi‐station queue with state‐dependent routingQueueing Systems, 1998
- A Queueing System with General-Use and Limited-Use ServersOperations Research, 1985