Design and evaluation of overloaded service systems with skill based routing, under FCFS policies

We study an overloaded service system with servers of types S={s1,…,sJ}, serving customers of types C={c1,…,cI} under FCFS. Customers arrive in Poisson streams, join the queue and then abandon or get served. Service is skill based, which is described by a compatibility graph G, where (i,j)¿G if server type sj is trained to serve customer type ci. The service duration depends on both server and customer type. This system is motivated by applications in areas as diverse as manufacturing, call centers, housing assignment, health care, data servers and online retailers. At this level of generality, the design in terms of staffing and cross-training decisions is a challenging problem. Based on recent results in and and on some asymptotic assumptions, we propose an algorithm to determine, for given data, the required levels of staffing to meet target levels of service quality and labor division. The algorithm is validated through a systematic simulation study, showing that it is remarkably robust and accurate. As such, we believe that the algorithm will prove to be useful in aiding the design and effective operation of complex systems with skill based routing. Keywords: Service system; First come first served policy; Multi type customers and servers; Infinite bipartite matching; Matching rates; Overloaded queues; Skill-based routing