Scheduling healthcare services in a home healthcare system

Journal of the Operational Research Society

Volumn 63, Issue 11, 2012, Pages 1589-1599

  An, Y J ^a   Kim, Y D ^a   Jeong, B J ^a   Kim, S D ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Hyundai Motor Co   (South Korea)

Author keywords

Heuristic; Home healthcare management; Scheduling

Indexed keywords

HEURISTIC ALGORITHMS; NURSING; TRAVEL TIME;

COMPUTATIONAL TESTS; HEALTHCARE SERVICES; HEURISTIC; HOME HEALTHCARE; HOME HEALTHCARE SYSTEMS; NEAR-OPTIMAL SOLUTIONS; SCHEDULING PROBLEM; TWO-PHASE HEURISTIC ALGORITHM;

SCHEDULING;

EID: 84867178190     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2011.153     Document Type: Article

References (41)

1. Aickelin U and White P (2004). Building better nurse scheduling algorithms. Annals of Operations Research 128(1/4): 159-177.
2. Alonso F, Alvarez MJ and Beasley JE (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society 59(7): 963-976.
3. Baldacci R, Bartolini E and Laporte G (2010). Some applications of the generalized vehicle routing problem. Journal of the Operational Research Society 61(7): 1072-1077.
4. Bektas T (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega-International Journal of Management Science 34: 209-219.
5. Bellman R (1962). Dynamic programming treatment of the travelling salesman problem. Journal of ACM 9(1): 61-63.
6. Beltrami EJ and Bodin LD (1974). Networks and vehicle routing for municipal waste collection. Networks 4(1): 65-94.
7. Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews: The state of the art. Computers & Operations Research 10(2): 63-211.
8. Burke EK, Curtois T, Qu R and Vanden Berghe G (2010). A scatter search methodology for the nurse rostering problem. Journal of the Operational Research Society 61(11): 1667-1679.
9. Chao I-M, Golden BL and Wasil E (1995). An improved heuristic for the period vehicle routing problem. Networks 26(1): 25-44.
10. Christofides N and Beasley JE (1984). The period routing problem. Networks 14(2): 237-256.
11. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2): 105-119.
12. Dansky KH and Dirani R (2008). The use of health care services by people with diabetes in rural areas. Journal of Rural Health 14(2): 129-137.
13. Derigs U and Reuter K (2009). A simple and efficient tabu search heuristic for solving the open vehicle routing problem. Journal of the Operational Research Society 60(12): 1658-1669.
14. Drummond LMA, Ochi LS and Vianna DS (2001). An asynchronous parallel metaheuristic for the period vehicle routing problem. Future Generation Computer Systems 17(4): 379-386.
15. Francis PM, Smilowitz KR and Tzur M (2006). The period vehicle routing problem with service choice. Transportation Science 40(4): 439-454.
16. Gaudioso M and Paletta G (1992). A heuristic for the periodic vehicle routing problem. Transportation Science 26(2): 86-92.
17. Gendreau M, Hertz A and Laporte G (1994). A tabu search heuristic for the vehicle routing problem. Management Science 40(10): 1276-1290.
18. GoodmanMD, Dowsland KA and Thompson JM(2009). A graspknapsack hybrid for a nurse-scheduling problem. Journal of Heuristics 15(4): 351-379.
19. Harper PR, Shahani AK, Gallagher JE and Bowie C (2005). Planning health services with explicit geographical considerations: A stochastic location-allocation approach. Omega- International Journal of Management Science 33: 141-152.
20. Jaumard B, Semet F and Vovor T (1998). A generalized linear programming model for nurse scheduling. European Journal of Operational Research 107(1): 1-18.
21. Kendra MA, Weiker A, Simon S, Grant A and Shullick D (2007). Safety concerns affecting delivery of home health care. Public Health Nursing 13(2): 83-89.
22. Kim D-G, Kim Y-D and Lee T (2010). A heuristic algorithm for locating two types of public healthcare facilities. Technical Report 2010-01, Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon 305-701, Korea.
23. Kwon Y-J, Kim J-G, Seo J, Lee D-H and Kim D-S (2007). A Voronoi tabu search algorithm for the capacitated vehicle routing problem. Journal of the Korean Institute of Industrial Engineers 33(4): 469-479.
24. Laporte G (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59(3): 345-358.
25. Lee S-H and Lee J-M (2005). Study on the heterogeneous fleet vehicle routing problem with customer restriction. Journal of the Korean Institute of Industrial Engineers 31(3): 228-239.
26. Maenhout B and Vanhoucke M (2009). The impact of incorporating nurse-specific characteristic in a cyclical scheduling approach. Journal of the Operational Research Society 60(12): 1683-1698.
27. Maenhout B and Vanhoucke M (2010). Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. Journal of Scheduling 13(1): 77-93.
28. Mourgaya M and Vanderbeck F (2006). Column generation based heuristic for tactical planning in multi-period vehicle routing. European Journal of Operational Research 183(3): 1028-1041.
29. Osman I (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41: 421-451.
30. Parr D and Thompson JM (2007). Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research 155(1): 279-288.
31. Pataki G (2003). Teaching integer programming formulations using the traveling salesman problem. SIAM Review 45(1): 116-123.
32. Rochat Y and Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1: 147-167.
33. Russell RA and Gribbin D (1991). A multiphase approach to the period routing problem. Networks 21(7): 747-765.
34. Russell RA and Igo W (1979). An assignment routing problem. Networks 9(1): 1-17.
35. Seong J and Moon I-K (2006). Vehicle routing problem with time windows considering outsourcing vehicles. Journal of the Korean Institute of Industrial Engineers 32(2): 91-97.
36. Shaughnessy PW and Kramer AM (1990). The increased needs of patients in nursing homes and patients receiving home health care. New England Journal of Medicine 322: 21-27.
37. Shaughnessy PW, Schlenker RE and Hittle DF (1994). Home health care outcomes under capitated and fee-for-service payment. Health Care Financial Review 16(1): 187-222.
38. Taillard E (1993). Parallel iterative search methods for vehicle routing problems. Networks 23: 661-673.
39. Tan CCR and Beasley JE (1984). A heuristic algorithm for the period vehicle routing problem. Omega-International Journal of Management Science 12(5): 497-504.
40. Tsai CC and Li SHA (2009). A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Systems with Applications 36(5): 9506-9512.
41. Woeginger GJ (2003). Exact algorithms for NP-hard problems: A survey. Lecture Notes in Computer Science 2570: 185-207.