The Home Care Crew Scheduling Problem | Anders Dohn, Matias Sevel Rasmussen, Tor Justesen, Jesper Larsen
| | Abstract | The Home Care Crew Scheduling Problem emerges in modern healthcare systems. The idea of home care is to offer a variety of services in the homes of the patients, whenever this is possible. A number of nurses and other personnel go from home to home and provide the necessary service. The Home Care Crew Scheduling Problem deals with the assignment of visits to caretakers and the scheduling of the visits. The objective of the mathematical optimization is to provide a higher level of service at a reduced cost. The problem is modeled as a set partitioning problem with side constraints and related to the vehicle routing problem with time windows, where this methodology has previously shown convincing results. The model is implemented using column generation in a Branch-and-Price framework and tested on four realistic test instances. The schedules generated are significantly better than the ones currently used in practice. | | Type | Misc [Other] | | Journal/Book/Conference | ORbit | | Year | 2008 Vol. 13 | | BibTeX data | [bibtex] | | IMM Group(s) | Operations Research |
|