On Fair Routing from Emergency Departments to Hospital Wards: QED Queues with Heterogeneous Servers
成果类型:
Article
署名作者:
Mandelbaum, Avishai; Momcilovic, Petar; Tseytlin, Yulia
署名单位:
Technion Israel Institute of Technology; State University System of Florida; University of Florida; University of Haifa; International Business Machines (IBM); IBM ISRAEL
刊物名称:
MANAGEMENT SCIENCE
ISSN/ISSBN:
0025-1909
DOI:
10.1287/mnsc.1110.1491
发表日期:
2012
页码:
1273-1291
关键词:
queueing systems
heterogeneous servers
Healthcare
hospital routing policies
fairness
quality- and efficiency-driven regime
asymptotic analysis
摘要:
The interface between an emergency department and internal wards is often a hospital's bottleneck. Motivated by this interaction in an anonymous hospital, we analyze queueing systems with heterogeneous server pools, where the pools represent the wards, and the servers are beds. Our queueing system, with a single centralized queue and several server pools, forms an inverted-V model. We introduce the randomized most-idle (RMI) routing policy and analyze it in the quality- and efficiency-driven regime, which is natural in our setting. The RMI policy results in the same server fairness (measured by idleness ratios) as the longest-idle-server-first (LISF) policy, which is commonly used in call centers and considered fair. However, the RMI policy utilizes only the information on the number of idle servers in different pools, whereas the LISF policy requires information that is unavailable in hospitals on a real-time basis.