Return to search

The therapist scheduling problem for patients with fixed appointment times

This report presents a series of models that can be used to find weekly schedules for therapists who provide ongoing treatment to patients scattered around a geographical region. In all cases, the patients’ appointment times and visit days are known prior to the beginning of the planning horizon. Variations in the model include single vs. multiple home bases, homogeneous vs. heterogeneous therapists, lunch break requirements, and a nonlinear cost structure for mileage reimbursement and overtime. The single home base and homogeneous therapist cases proved to be easy to solve and so were not investigated. This left two cases of interest: the first includes only lunch breaks while the second adds overtime and mileage reimbursement. In all, 40 randomly generated data sets were solved that consisted of either 15 or 20 therapists and between roughly 300 and 540 visits over five days. For each instance, we were able to obtain the minimum cost of providing home healthcare services for both models using CPLEX 12.2. The results showed that CPU time increases more rapidly than total cost as the total number of visits grows. In general, data sets with therapists who have different starting and ending locations are more difficult to solve than those whose therapists have the same home base. / text

Identiferoai:union.ndltd.org:UTEXAS/oai:repositories.lib.utexas.edu:2152/ETD-UT-2011-12-4512
Date27 February 2012
CreatorsWang, Huan, master of science in engineering
Source SetsUniversity of Texas
LanguageEnglish
Detected LanguageEnglish
Typethesis
Formatapplication/pdf

Page generated in 0.0019 seconds