Setting staffing requirements for time dependent queueing networks: The case of accident and emergency departments

► We considered the staffing problem in English emergency departments. ► We combined queueing and simulation models to search for minimal staffing profiles. ► Applying the method to a generic ED shows that improvements can be made even without increase in total staff-hours. ► Improvements arise as t...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 219; no. 3; pp. 531 - 540
Main Authors Izady, Navid, Worthington, Dave
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.06.2012
Elsevier
Elsevier Sequoia S.A
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:► We considered the staffing problem in English emergency departments. ► We combined queueing and simulation models to search for minimal staffing profiles. ► Applying the method to a generic ED shows that improvements can be made even without increase in total staff-hours. ► Improvements arise as the result of matching staffing levels closely with demand. 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% of patients to be discharged, transferred, or admitted to inpatient care within 4hours 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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2011.10.040