Scalable Approaches to Home Health Care Scheduling Problems Uncertainty - Robotics Institute Carnegie Mellon University

Scalable Approaches to Home Health Care Scheduling Problems Uncertainty

C. Chen, Z. B. Rubinstein, S. F. Smith, and H. C. Lau
Workshop Paper, AAAI '17 Workshop on AI and OR for Social Good, January, 2017

Abstract

In this work, we consider the weekly home health care scheduling problem with time windows, continuity of care, workload fairness, and inter-visit temporal dependency, and service/travel time uncertainties. We formulate the problem as a chance constrained mathematical model. We further apply Lagrangian relaxation, exploit the separable structure of the problem, and handle the uncertainties by employing a sampling-based strategy. Experiments have been conducted on a real-world dataset to demonstrate the effectiveness and efficiency of our proposed approaches.

BibTeX

@workshop{Chen-2017-120543,
author = {C. Chen and Z. B. Rubinstein and S. F. Smith and H. C. Lau},
title = {Scalable Approaches to Home Health Care Scheduling Problems Uncertainty},
booktitle = {Proceedings of AAAI '17 Workshop on AI and OR for Social Good},
year = {2017},
month = {January},
}