A decomposition - construction approach for solving the home health care scheduling problem

Chaieb, Marouene; Jemai, Jaber; Mellouli, Khaled

doi:10.1007/s10729-019-09479-z

Cited by 18 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…HHCRSP problems cover a wide range of constraints and objectives. They may include typical features of Vehicle Routing Problems (VRPs), such as time windows (hard or soft) [8] and temporal dependencies (precedence, synchronization, or disjunction) [9], but also more specific features related to the field such as continuity of care [10], skill requirements [11], or incompatibilities [12]. The objective is often cost-related, whether it comes to minimizing travel costs or staffing costs [13,14] or is stakeholder-oriented [8].…”

Section: Literature Reviewmentioning

confidence: 99%

The Centralization and Sharing of Information for Improving a Resilient Approach Based on Decision-Making at a Local Home Health Care Center

et al. 2023

View full text Add to dashboard Cite

Home care centers face both an increase in demand and many variations during the execution of routes, compromising the routes initially planned; robust solutions are not effective enough, and it is necessary to move on to resilient approaches. We create a close-to-reality use case supported by interviews of staff at home health care centers, where caregivers are faced with unexpected events that compromise their initial route. We model, analyze, and compare two resilient approaches to deal with these disruptions: a distributed collaborative approach and a centralized collaborative approach, where we propose a centralization and sharing of information to improve local decision-making. The latter reduces the number of late arrivals by 11%, the total time of late arrival by 21%, and halves the number of routes exceeding the end of work time (contrary to the distributed collaborative approach due to the time wasted reaching colleagues). The use of a device, such as a smartphone application, to centralize and share information thus, allows better mutual assistance between caregivers. Moreover, we highlight several possible openings, like the coupling of simulation and optimization, to propose a more resilient approach.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

The Centralization and Sharing of Information for Improving a Resilient Approach Based on Decision-Making at a Local Home Health Care Center

et al. 2023

View full text Add to dashboard Cite

show abstract

“…Several planning problems are involved in HC management, which can be solved either together or separately. [5] divided HC management into three sub-problems, namely grouping, assignment and routing. [6] proposed a threephase decision support methodology to identify the decision rules for patient acceptance, staff hiring and staff utilization.…”

Section: Literature Reviewmentioning

confidence: 99%

Home care vehicle routing problem with chargeable overtime and strict and soft preference matching

Malagodi

Lanzarone

Matta

2021

Health Care Manag Sci

View full text Add to dashboard Cite

A new scheduling problem arising in the home care context is addressed, whose novelty with respect to the literature lies in the way overtime is paid. In this problem, some clients are willing to pay a higher fee to cover the additional overtime cost, if such overtime is incurred because a caregiver works extra time with the client to preserve continuity of care. These overtime hours charged to clients unburden the company, which no longer has to balance between cost and continuity of care in a traditional way. The problem is also studied in a context that includes preferences expressed by both clients and caregivers. Strict preferences must be respected with a high priority, while soft preferences increase the satisfaction and should be preferably respected. We formalize the problem as a Mixed Integer Linear Problem and also propose a cluster-based decomposition to solve real-life instances. The problem is inspired by the real case study of a provider operating in the USA. Numerical results validate the model and confirm the capability of the decomposition approach to deal with real-life instances.

show abstract

“…The problem is formulated as mixed-integer linear program which is solved by decomposing the whole problem by patients' typology and day. Chaieb et al [17] consider the skills of caregivers and time windows and preference of clients. The problem is decomposed into three subproblems which is solved by k-means, Hungarian algorithm, and Tabu search respectively.…”

Section: Literature Reviewmentioning

confidence: 99%

A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching

Gong

Geng

Zhu

et al. 2021

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Home Care (HC) services represent an effective solution to face the health issues related to population aging. However, several scheduling problems arise in HC and the providers must make several scheduling and routing decisions, e.g. the assignment of caregivers to clients, in order to balance operating costs and client satisfaction. Starting from the analysis of a real HC provider operating in New York City, NY, USA, this paper addresses a scheduling problem with chargeable overtime and preference matching, and formulates it as an integer programming model. The objective is to minimize a cost function that includes travelling costs, the overtime cost paid by the provider, the preference mismatch and a penalty related to the continuity of care violation. To solve this problem, we design a matheuristic algorithm which integrates a specific variable neighborhood search with a set covering model. The results demonstrate the applicability and efficiency of our approach in solving real-size instances. Sensitivity analyses are also performed to discuss practical insights. Note to Practitioners-This paper provides a decision support tool to HC managers, which appropriately assigns caregivers to clients and makes routing decision over a long horizon.Chargeable overtimes and preference matching enclosed in this tool are rarely considered in the literature, despite matching is relevant in HC caregiver-to-client assignments and chargeable overtime has a potential in tailoring the service level based on the specific client. We formulate the scheduling problem as a mathematical model. Then, we propose a matheuristic algorithm to efficiently solve the problem in real-size instances. The results show the applicability and efficiency of our method. Thus, HC managers can exploit it to efficiently make assignment and routing decisions, and to analyze the impact on other operating costs when adjusting any of them.

show abstract

A decomposition - construction approach for solving the home health care scheduling problem

Cited by 18 publications

References 12 publications

The Centralization and Sharing of Information for Improving a Resilient Approach Based on Decision-Making at a Local Home Health Care Center

The Centralization and Sharing of Information for Improving a Resilient Approach Based on Decision-Making at a Local Home Health Care Center

Home care vehicle routing problem with chargeable overtime and strict and soft preference matching

A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching

Contact Info

Product

Resources

About