A Home Health Care Routing and Scheduling Problem

Simple item page
dc.contributor.authorCheng, Eddie
dc.contributor.authorRich, Jennifer Lynn
dc.date.accessioned2018-06-18T17:47:05Z
dc.date.available2018-06-18T17:47:05Z
dc.date.issued1998-06
dc.date.noterevised June 1998
dc.description.abstractConsider the problem of routing a set of nurses from each individual nurse's home to a set of patients and back home again. Each patient must be visited by a single "feasible" nurse during its time window. Essentially, this is a multi-depot vehicle routing problem with time windows with additional feasibility restrictions on which nurses can visit which patients. This problem is NP-Hard. We give mixed integer linear programming formulations of this problem and a parallel tour-building heuristic for finding a good solution.
dc.format.extent16 pp
dc.identifier.citationCheng, Eddie and Rich, Jennifer Lynn. "A Home Health Care Routing and Scheduling Problem." (1998) <a href="https://hdl.handle.net/1911/101899">https://hdl.handle.net/1911/101899</a>.
dc.identifier.digitalTR98-04
dc.identifier.urihttps://hdl.handle.net/1911/101899
dc.language.isoeng
dc.titleA Home Health Care Routing and Scheduling Problem
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR98-04.pdf
Size:
201.17 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports