Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 680152, 8 pages
http://dx.doi.org/10.1155/2013/680152
Research Article

Emergency Department Staffing: A Separated Continuous Linear Programming Approach

Lingnan (University) College, Sun Yat-sen University, Guangzhou, Guangdong 510275, China

Received 2 August 2013; Revised 12 September 2013; Accepted 12 September 2013

Academic Editor: Pui-Sze Chow

Copyright © 2013 Xiaoqing Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. W. Derlet, J. R. Richards, and R. L. Kravitz, “Frequent overcrowding in U.S. emergency departments,” Academic Emergency Medicine, vol. 8, no. 2, pp. 151–155, 2001. View at Google Scholar · View at Scopus
  2. R. W. Derlet and J. R. Richards, “Overcrowding in the nation's emergency departments: complex causes and disturbing effects,” Annals of Emergency Medicine, vol. 35, no. 1, pp. 63–68, 2000. View at Google Scholar · View at Scopus
  3. J. Kennedy, K. Rhodes, C. A. Walls, and B. R. Asplin, “Access to emergency care: restricted by long waiting times and cost and coverage concerns,” Annals of Emergency Medicine, vol. 43, no. 5, pp. 567–573, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. L. G. Graff, S. Wolf, R. Dinwoodie, D. Buono, and D. Mucci, “Emergency physician workload: a time study,” Annals of Emergency Medicine, vol. 22, no. 7, pp. 1156–1163, 1993. View at Google Scholar · View at Scopus
  5. S. Zeltyn, Y. N. Marmor, A. Mandelbaum et al., “Simulation-based models of emergency departments: operational, tactical, and strategic staffing,” ACM Transactions on Modeling and Computer Simulation, vol. 21, no. 4, article 24, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. R. W. Hall, Queueing Methods for Service and Manufacturing, Prentice Hall, Upper Saddle River, NJ, USA, 1990.
  7. L. V. Green, P. J. Kolesar, and J. Soares, “Improving the sipp approach for staffing service systems that have cyclic demands,” Operations Research, vol. 49, no. 4, pp. 549–564, 2001. View at Google Scholar · View at Scopus
  8. L. V. Green, J. Soares, J. F. Giglio, and R. A. Green, “Using queueing theory to increase the effectiveness of emergency department provider staffing,” Academic Emergency Medicine, vol. 13, no. 1, pp. 61–68, 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. G. B. Yom-Tov and A. Mandelbaum, “Erlang-R: a time-varying queue with ReEntrant customers, in support of healthcare staffng,” Working Paper, Technion-Israel Institute of Technology, 2011. View at Google Scholar
  10. E. J. Anderson, A Continuous Model for Job-Shop Scheduling [Ph.D. thesis], University of Cambridge, Cambridge, UK, 1978.
  11. G. Weiss, “A simplex based algorithm to solve separated continuous linear programs,” Mathematical Programming, vol. 115, no. 1, pp. 151–198, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. H. Chen and D. D. Yao, Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization, Applications of Mathematics, vol. 46, Springer, New York, NY, USA, 2001.
  13. J. G. Dai, “On positive harris recurrence of multi-class queueing networks: a unified approach via fluid limit models,” Annals of Applied Probability, vol. 5, no. 1, pp. 49–77, 1995. View at Publisher · View at Google Scholar
  14. X. Wang, “Review on the research for separated continuous linear programming: with applications on service operation,” Mathematical Problems in Engineering, vol. 2013, Article ID 408048, 9 pages, 2013. View at Publisher · View at Google Scholar
  15. X. Wang, Theory and algorithms for separated continuous linear programming and its extensions [Ph.D. thesis], The Chinese University of Hong Kong, Hong Kong, China, 2005.
  16. J. Huang, B. Carmeli, and A. Mandelbaum, “Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback,” Submitted to Operations Research.
  17. A. Segall, “The modeling of adaptive routing in data-communication networks,” IEEE Transactions on Communications, vol. 25, no. 1, pp. 85–95, 1977. View at Google Scholar · View at Scopus
  18. W. Whitt, “Efficiency-driven heavy-traffic approximations for many-server queues with abandonments,” Management Science, vol. 50, no. 10, pp. 1449–1461, 2004. View at Publisher · View at Google Scholar · View at Scopus
  19. W. Whitt, “Fluid models for multiserver queues with abandonments,” Operations Research, vol. 54, no. 1, pp. 37–54, 2006. View at Publisher · View at Google Scholar · View at Scopus