A skill based parallel service system under FCFS-ALIS ‒ steady state, overloads and abandonments
We consider a queueing system with servers S={m<sub>1</sub>,...,m<sub>J</sub>}, and with customer types C={a,b,...}. A bipartite graph G describes which pairs of server-customer types are compatible. We consider FCFS-ALIS policy: A server always picks the first, longest waiti...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2014-09-01
|
| Series: | Stochastic Systems |
| Subjects: | |
| Online Access: | http://www.i-journals.org/ssy/viewarticle.php?id=117&layout=abstract |