Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8953641 | European Journal of Operational Research | 2019 | 25 Pages |
Abstract
Constrained by targets on patient waiting time, we consider the problem of minimizing the total amount of staff-resources allocated to an emergency department. We test a matheuristic approach to this problem, accounting for both patient flow and staff scheduling restrictions. Using a continuous-time Markov chain, patient flow is modeled as a time-dependent queueing network where inhomogeneous behavior is evaluated using the uniformization method. Based on this modeling approach, we recursively evaluate and allocate staff to the system using integer linear programming until the waiting time targets are respected in all queues of the network. By comparing to discrete-event simulations of the associated system, we show that this approach is adequate for both modeling and optimizing the patient flow. In addition, we demonstrate robustness to the service time distribution and the associated system with multiple classes of patients.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Anders Reenberg Andersen, Bo Friis Nielsen, Line Blander Reinhardt, Thomas Riis Stidsen,