Modeling and solving the dynamic patient admission scheduling problem under uncertainty

Artificial Intelligence in Medicine

Volumn 56, Issue 3, 2012, Pages 199-205

  Ceschia, Sara ^a   Schaerf, Andrea ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Length of stay uncertainty; Local search; Patient admission scheduling; Simulated annealing

Indexed keywords

DATA SETS; DYNAMIC PROBLEM; EMERGENCY PATIENTS; EXACT METHODS; HEALTHCARE DOMAINS; INTEGER LINEAR PROGRAMMING; LENGTH OF STAY; LOCAL SEARCH; META-HEURISTIC APPROACH; NEIGHBORHOOD STRUCTURE; SCHEDULING PROBLEM; SEARCH METHOD; SOLUTION PROCESS;

HEALTH CARE; INTEGER PROGRAMMING; SCHEDULING; SIMULATED ANNEALING; UNCERTAINTY ANALYSIS;

PROBLEM SOLVING;

ARTICLE; HOSPITAL ADMISSION; HUMAN; LENGTH OF STAY; MODEL; PATIENT SCHEDULING; PRIORITY JOURNAL; PROBLEM SOLVING; SYSTEM ANALYSIS; UNCERTAINTY;

AGE FACTORS; APPOINTMENTS AND SCHEDULES; EFFICIENCY, ORGANIZATIONAL; HOSPITAL BED CAPACITY; HUMANS; LENGTH OF STAY; MEDICINE; PATIENT ADMISSION; PROGRAMMING, LINEAR; SEX FACTORS; TIME FACTORS; UNCERTAINTY;

EID: 84870461777     PISSN: 09333657     EISSN: 18732860     Source Type: Journal    
DOI: 10.1016/j.artmed.2012.09.001     Document Type: Article

References (20)

1. Demeester P., Souffriau W., De Causmaecker P., Vanden Berghe G. A hybrid tabu search algorithm for automatically assigning patients to beds. Artificial Intelligence in Medicine 2010, 48(1):61-70.
2. Bilgin B, Demeester P, Misir M, Vancroonenburg W, Vanden Berghe G. One hyper-heuristic approach to two timetabling problems in health care. Journal of Heuristics 2011; Online first doi:10.1007/s10732-011-9192-0.
3. Vancroonenburg W, Goossens D, Spieksma F. On the complexity of the patient assignment problem; 2011. Available from http://allserv.kahosl.be/wimvc/pas-complexity-techreport.pdf.
4. Kusters R., Groot P.M. Modelling resource availability in general hospitals design and implementation of a decision support model. European Journal of Operational Research 1996, 88(3):428-445.
5. Gemmel P., Van Dierdonck R. Admission scheduling in acute care hospitals: does the practice fit with the theory?. International Journal of Operations & Production Management 1999, 19(9):863-878.
6. Eaton W., Whitmore G.A. Length of stay as a stochastic process: a general approach and application to hospitalization for schizophrenia. The Journal of Mathematical Sociology 1977, 5(2):273-292.
7. Forster A.J., Stiell I., Wells G., Lee A.J., van Walraven C. The effect of hospital occupancy on emergency department length of stay and patient disposition. Academic Emergency Medicine: official Journal of the Society for Academic Emergency Medicine 2003, 10(2):127-133.
8. Ouelhadj D., Petrovic S. Survey of dynamic scheduling in manufacturing systems. Journal of Scheduling 2008, 12(4):417-431.
9. Ceschia S., Schaerf A. Local search and lower bounds for the patient admission scheduling problem. Computers & Operations Research 2011, 38(10):1452-1463.
10. Demeester P. Patient admission scheduling website. ; 2009. http://allserv.kahosl.be/peter/pas/.
11. Herroelen W., Leus R. Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research 2005, 165(2):289-306.
12. Weissman C. Analyzing intensive care unit length of stay data: Problems and possible solutions. Critical Care Medicine 1997, 25(9):1594-1600.
13. Larsen A. The dynamic vehicle routing problem. Ph.D. thesis; Technical University of Denmark (DTU); 2001.
14. Di Gaspero L., Schaerf A. Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 2006, 5(1):65-89.
15. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science 1983, 220:671-680.
16. černý V. Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications 1985, 45(l):41-51.
17. Aarts E.H.L., Korst J. Simulated Annealing and Boltzmann Machines 1989, John Wiley & Sons, New York.
18. van Laarhoven P.J.M., Aarts E.H.L. Simulated Annealing: Theory and Applications 1987, D. Reidel Publishing Company, Kluwer Academic Publishers Group, Norwell, MA, USA.
19. Di Gaspero L., Schaerf A. EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software-Practice and Experience 2003, 33(8):733-765.
20. Birattari M., Yuan Z., Balaprakash P., Stützle T. F-Race and Iterated F-race: An overview 2010, Springer, Berlin.