Location of Repository

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

By Navid Izady and Dave Worthington

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% 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 hour

Topics: HD28, RA, RT
Year: 2012
OAI identifier: oai:eprints.soton.ac.uk:176781
Provided by: e-Prints Soton

Suggested articles

Preview

Citations

  1. (2005). A stang algorithm for call centers with skill-based routing. doi
  2. (1985). Allocating doctors to shifts in an accident and emergency department. doi
  3. (1976). An integrated work shift scheduling system. doi
  4. (2010). Combining integer programming and the randomization method to schedule employees. doi
  5. (2007). Coping with time-varying demand when setting stang requirements for a service system. doi
  6. (2006). Eectiveness of measures to reduce emergency department waiting times: a natural experiment. doi
  7. (2005). Emergency department operations: The basis for developing a simulation tool. doi
  8. (2009). Health Annual Report. doi
  9. (2010). Health Statistics. doi
  10. (1981). Heavy-trac limits for queues with many exponential servers. doi
  11. (2001). Improving the sipp approach for stang service systems that have cyclic demands. doi
  12. (2001). Mathematical modelling of patient ow through an accident and emergency department. doi
  13. (1993). Networks of in queues with nonstationary poisson input. doi
  14. (1997). Peak congestion in multi-server service systems with slowly varying arrival rates. Queueing Systems
  15. (1996). Server stang to meet time-varying demand. doi
  16. (2007). Staggered work shifts: a way to downsize and restructure an emergency 23department workforce yet maintain current operational performance. doi
  17. (2008). Stang of time-varying queues to achieve time-stable performance. doi
  18. (2007). The "4-hour target": emergency nurses' views. doi
  19. (2006). The DH accident and emergency department 22model: a national generic model used locally. doi
  20. (1997). The lagged psa for estimating peak congestion in multiserver markovian queues with periodic arrival rates. doi
  21. (2004). Total time in english accident and emergency departments is related to bed occupancy. doi
  22. (2006). Understanding accident and emergency department performance using simulation. doi
  23. (2009). Understanding target-driven action in emergency department performance using simulation. doi
  24. (1992). Understanding the eciency of multi-server service systems. doi
  25. (2006). Using queueing theory to increase the eectiveness of emergency department provider stang. doi
  26. (2008). Using queuing theory to analyse the Governments 4-h completion time target in accident and emergency departments. doi
  27. (2007). What you should know about queueing models to set stang requirements in service systems. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.