A skill based parallel service system under FCFS-ALIS : steady state, overloads and abandonments

I.J.B.F. Adan, G. Weiss

Research output: Contribution to journalArticleAcademicpeer-review

181 Downloads (Pure)


We consider a queueing system with servers S={m1,...,mJ}, 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 waiting compatible customer, and a customer is always assigned to the longest idle compatible server. We assume Poisson arrivals and server dependent exponential service times. We derive an explicit product-form expression for the stationary distribution of this system when service capacity is sufficient. We also calculate fluid limits of the system under overload, to show that local steady state exists. We distinguish the case of complete resource pooling when all the customers are served at the same rate by the pooled servers, and the case when the system has a unique decomposition into subsets of customer types, each of which is served at its own rate by a pooled subset of the servers. Finally, we discuss possible behavior of the system with generally distributed abandonments, under many server scaling. This paper complements and extends previous results of Kaplan, Caldentey and Weiss [18], and of Whitt and Talreja [34], as well as previous results of the authors [4, 35] on this topic. Keywords: Service systems, multi type customers, multi type skill based servers, matching of infinite sequences, product form solution, first come first served policy, assign longest idle server policy, complete resource pooling, local steady state, overloaded queues, abandonment.
Original languageEnglish
Pages (from-to)250-299
JournalStochastic Systems
Issue number1
Publication statusPublished - 2014


Dive into the research topics of 'A skill based parallel service system under FCFS-ALIS : steady state, overloads and abandonments'. Together they form a unique fingerprint.

Cite this