Scheduling healthcare services in a home healthcare system

Cited 10 time in webofscience Cited 0 time in scopus
  • Hit : 324
  • Download : 0
We consider a scheduling problem in a home healthcare system in which nurses visit patients regularly for relatively minor healthcare services. Intervals between the visits may differ for different patients. On each day in the planning horizon, a nurse must visit the patients assigned to her/him on that day, and then return to the hospital. For the problem of determining the visiting schedule with the objective of minimizing total travel time of the nurse over the planning horizon, we develop a two-phase heuristic algorithm. To evaluate performance of the proposed algorithm, a series of computational tests is performed on a number of randomly generated problem instances and a real instance. Results of the tests show that the heuristic algorithm gives near optimal solutions for problems of practical sizes in a reasonable time. Journal of the Operational Research Society (2012) 63, 1589-1599. doi:10.1057/jors.2011.153 published online 29 February 2012
Publisher
PALGRAVE MACMILLAN LTD
Issue Date
2012-11
Language
English
Article Type
Article
Keywords

VEHICLE-ROUTING PROBLEM; TRAVELING SALESMAN PROBLEM; ALGORITHMS; FORMULATIONS

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.63, no.11, pp.1589 - 1599

ISSN
0160-5682
DOI
10.1057/jors.2011.153
URI
http://hdl.handle.net/10203/95825
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 10 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0