Home > Research > Publications & Outputs > Setting Staffing Requirements for Time Dependen...
View graph of relations

Setting Staffing Requirements for Time Dependent Queueing Networks: The Case of Accident and Emergency Departments

Research output: Contribution to journalJournal article

Published

Standard

Setting Staffing Requirements for Time Dependent Queueing Networks: The Case of Accident and Emergency Departments. / Izady, Navid; Worthington, David.

In: European Journal of Operational Research, Vol. 219, No. 3, 2012, p. 531-540.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Izady, Navid ; Worthington, David. / Setting Staffing Requirements for Time Dependent Queueing Networks: The Case of Accident and Emergency Departments. In: European Journal of Operational Research. 2012 ; Vol. 219, No. 3. pp. 531-540.

Bibtex

@article{c858f7e7860e4c4988ebd88fc6b002e5,
title = "Setting Staffing Requirements for Time Dependent Queueing Networks: The Case of Accident and Emergency Departments",
abstract = "An incentive scheme aimed at reducing patients' waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98 percent of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of arrival. Setting the minimal hour by hour medical staffing levels for achieving the government target, in the presence of complexities like time-varying demand, multiple types of patients, and resource sharing, is the subject of this paper. Building on extensive body of research on time dependent queues, we propose an iterative scheme which uses infinite server networks, the square root staffing law, and simulation to come up with a good solution. The implementation of this algorithm in a typical A&E department suggests that significant improvement on the target can be gained, even without increase in total staff hours.",
keywords = "Time-dependent queues, Staffing emergency departments",
author = "Navid Izady and David Worthington",
year = "2012",
doi = "10.1016/j.ejor.2011.10.040",
language = "English",
volume = "219",
pages = "531--540",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "3",

}

RIS

TY - JOUR

T1 - Setting Staffing Requirements for Time Dependent Queueing Networks: The Case of Accident and Emergency Departments

AU - Izady, Navid

AU - Worthington, David

PY - 2012

Y1 - 2012

N2 - An incentive scheme aimed at reducing patients' waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98 percent of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of arrival. Setting the minimal hour by hour medical staffing levels for achieving the government target, in the presence of complexities like time-varying demand, multiple types of patients, and resource sharing, is the subject of this paper. Building on extensive body of research on time dependent queues, we propose an iterative scheme which uses infinite server networks, the square root staffing law, and simulation to come up with a good solution. The implementation of this algorithm in a typical A&E department suggests that significant improvement on the target can be gained, even without increase in total staff hours.

AB - An incentive scheme aimed at reducing patients' waiting times in accident and emergency departments was introduced by the UK government in 2000. It requires 98 percent of patients to be discharged, transferred, or admitted to inpatient care within 4 hours of arrival. Setting the minimal hour by hour medical staffing levels for achieving the government target, in the presence of complexities like time-varying demand, multiple types of patients, and resource sharing, is the subject of this paper. Building on extensive body of research on time dependent queues, we propose an iterative scheme which uses infinite server networks, the square root staffing law, and simulation to come up with a good solution. The implementation of this algorithm in a typical A&E department suggests that significant improvement on the target can be gained, even without increase in total staff hours.

KW - Time-dependent queues

KW - Staffing emergency departments

U2 - 10.1016/j.ejor.2011.10.040

DO - 10.1016/j.ejor.2011.10.040

M3 - Journal article

VL - 219

SP - 531

EP - 540

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -