The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies

Matias Sevel Rasmussen, Tor Justesen, Anders Dohn and Jesper Larsen

European Journal of Operational Research, 2012, vol. 219, issue 3, 598-610

Abstract: In the Home Care Crew Scheduling Problem a staff of home carers has to be assigned a number of visits to patients’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time windows of the visits must be respected. The challenge when assigning visits to home carers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits.

Keywords: Home care; Crew scheduling; Vehicle routing; Generalised precedence constraints; Branch-and-price; Set partitioning (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (78)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221711009891
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:219:y:2012:i:3:p:598-610

DOI: 10.1016/j.ejor.2011.10.048

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().