Abstract | ||
---|---|---|
We consider a two-stage, multi-server queueing network that serves two types of customers, which we refer to as type a and type b. Type a customers require service at both sequential stages and type b customers only require service at the second stage. The first stage has one node and the second stage has multiple nodes. Type a customers possess a higher non-pre-emptive priority than type b customers. Depending on the model application, two goals are explored: the first goal is to allocate type a customers to the second- stage nodes in a manner that minimizes the average blocking delay; the second goal is to optimize the service speed of each server in the second stage so that the average blocking delay experienced by type a customers is minimized. In this paper, we develop an approximation scheme and an iterative algorithm to find stationary policies, which we then apply to the real-world contexts of Emergency Medical Services planning and airline staffing. Numerical examples show that, compared to some typical heuristic schemes (e.g., proportional allocation based on arrival/service capacity), the suggested allocation policies result in type a customers experiencing shorter delays and allow more of them receive service. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1080/01605682.2018.1438762 | JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY |
Keywords | Field | DocType |
Optimization,queueing models,service systems,work load allocation | Computer science,Multi server,Service system,Computer network,Queueing theory,Operations management | Journal |
Volume | Issue | ISSN |
70.0 | 2.0 | 0160-5682 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Eman Almehdawe | 1 | 8 | 1.62 |
Beth Jewkes | 2 | 8 | 0.94 |
Qi-Ming He | 3 | 230 | 34.21 |