Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility
From MaRDI portal
Publication:2676402
DOI10.1016/j.cor.2022.106000MaRDI QIDQ2676402
Reza Tavakkoli-Moghaddam, Nastaran Oladzad-Abbasabady
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106000
scheduling; routing; matheuristics; home health care; unexpected events; caregiver-patient compatibility
90Bxx: Operations research and management science
Related Items
Cites Work
- Home care service planning. The case of Landelijke Thuiszorg
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- Securing home health care in times of natural disasters
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Home health care routing and scheduling: a review
- A set partitioning heuristic for the home health care routing and scheduling problem
- Real-time scheduling optimization considering the unexpected events in home health care
- Optimal patient and personnel scheduling policies for care-at-home service facilities
- Mid-term and short-term planning support for home health care services
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A matheuristic algorithm for stochastic home health care planning
- Home service routing and appointment scheduling with stochastic service times
- Prioritized single nurse routing and scheduling for home healthcare services
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
