Pith. sign in

REVIEW 2 major objections 1 minor 50 references

Task-splitting in home healthcare routing and scheduling

T0 review · 2 major / 1 minor · reviewed 2026-05-24 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗

Pith's one-line read Allowing patient visits to be split among multiple caregivers reduces the total staff needed and lowers home healthcare costs while improving skill alignment.

desk verdict Task-splitting is a concrete modeling extension for HHC routing that their MILPs and heuristics can handle, but the claimed staff and cost reductions rest on instances that omit several practical constraints. read the letter →

arxiv 2406.19288 v3 submitted 2024-06-27 math.OC

Loek van Montfort , Wout Dullaert , Markus Leitner This is my paper
classification math.OC
keywords homehealthcareroutingandschedulingtask-splittingmixedintegerlinearprogrammingtemporaldependenciesoperationalcostsheuristics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper adds task-splitting decisions to home healthcare routing and scheduling, where a single long visit can be broken into separate visits performed by different caregivers at different times, possibly with changed requirements or time windows. It presents two mixed-integer linear programming models plus heuristics that jointly choose routes, timetables, and which visits to split while respecting new temporal links between the parts. Computational tests on generated instances show the added synchronization increases difficulty but the solution methods remain practical. The central result is that the integrated approach cuts required staff, reduces overall costs, and shifts more caregiver time toward tasks matching their qualifications. A sympathetic reader cares because home healthcare providers face rising demand and tight labor supply, so any systematic way to stretch existing capacity without extra hires matters.

What carries the argument

Two mixed-integer linear programming formulations (Miller-Tucker-Zemlin and time-indexed) that simultaneously optimize caregiver routes and decide visit splits while enforcing a range of temporal dependencies between split parts.

What would settle it

Apply the models to a full set of daily patient requests and caregiver availability from an operating home healthcare agency, then compare the resulting total staff hours and cost against the agency's current manual schedules that do not allow splitting.

Watch

Extended reading notes

Core claim

Incorporating decisions on which visits to split, along with the resulting temporal dependencies, into the route and schedule optimization allows the planning process to achieve lower operational costs, fewer total caregivers, and a higher fraction of time spent on qualification-matched tasks than is possible when every visit must be performed by a single caregiver.

Load-bearing premise

The tested instances and model constraints are representative enough that the observed reductions in staff and cost will appear when the same approach is used on real daily operations.

Editorial extensions

If this is right

  • Integrating task-splitting decisions reduces the number of caregivers required.
  • Operational costs for home healthcare providers decrease when splits are chosen inside the optimization.
  • Caregivers spend a larger share of their time on tasks that match their qualification level.
  • The added synchronization constraints make the problem computationally harder, but the proposed heuristics and pre-processing routines keep solution times manageable.
  • The time-indexed formulation with embedded primal and improvement heuristics produces good feasible solutions inside branch-and-bound.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Agencies could use the same split logic to create part-time or shared-shift roles that reduce overtime.
  • Patient satisfaction might improve if splits allow visits at more convenient times even when total care minutes stay the same.
  • Coordination software would need new features to track dependencies between split visits so caregivers know when the other part has been completed.
  • The approach could be extended to decide which parts of a visit must stay together for clinical reasons versus which can be separated.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 1 minor

Summary. The paper introduces task-splitting (dividing lengthy patient visits into separate visits by different caregivers) into home healthcare routing and scheduling. It presents two MILP formulations (Miller-Tucker-Zemlin and time-indexed) that jointly decide splits and routes while minimizing operational costs and enforcing qualification, time-window, and synchronization constraints; it also describes pre-processing routines, two heuristics embedded in branch-and-bound, and a computational study whose results indicate that allowing splits reduces staff requirements, lowers costs, and improves caregiver-task qualification alignment.

Significance. If the modeled cost and staff reductions are shown to be robust, the work would provide a concrete planning tool that relaxes rigid visit structures in HHC, potentially improving both efficiency and caregiver utilization. The dual formulations and embedded heuristics constitute a methodological contribution that could be extended to related routing problems with synchronization.

major comments (2)
  1. [Abstract / computational study] Abstract and computational study description: the claim that integrating task-splitting 'reduces staff requirements, decreases HHC operational costs' rests on results whose instance-generation procedure, baseline definitions, and verification against omitted real-world constraints (stochastic travel, continuity preferences, regulatory minima) are not reported; without these details the gap between the tested MILP and an operationally valid model remains load-bearing for the central planning claim.
  2. [Formulation sections] Formulation sections: while the MTZ and time-indexed models correctly encode split decisions and temporal dependencies, the paper does not demonstrate that the objective function and constraint set remain feasible when additional operational constraints (e.g., patient refusal of multiple caregivers or minimum visit durations) are added post hoc; this omission directly affects whether the reported savings survive realistic extensions.
minor comments (1)
  1. Notation for split-visit temporal dependencies could be clarified with an explicit small example showing the additional synchronization constraints introduced by a split.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. We address the two major comments point-by-point below. Where the comments identify gaps in reporting or scope clarification, we will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract / computational study] Abstract and computational study description: the claim that integrating task-splitting 'reduces staff requirements, decreases HHC operational costs' rests on results whose instance-generation procedure, baseline definitions, and verification against omitted real-world constraints (stochastic travel, continuity preferences, regulatory minima) are not reported; without these details the gap between the tested MILP and an operationally valid model remains load-bearing for the central planning claim.

    Authors: We agree that the computational study section would benefit from expanded detail on instance generation and explicit baseline definitions. The instances are constructed from real HHC operational characteristics (patient locations, visit durations, qualification requirements, and time windows drawn from anonymized operational data), with the no-split case serving as the baseline. In revision we will add a dedicated subsection detailing the generation procedure, parameter distributions, and how the baseline is obtained by disabling split variables. Regarding omitted constraints, the paper presents a deterministic model under the stated assumptions; we will add an explicit limitations paragraph in the conclusions discussing stochastic travel, continuity preferences, and regulatory minima, and note that the reported savings hold within the modeled deterministic setting. The central claim is therefore scoped to the tested model rather than claiming full operational validity. revision: yes

  2. Referee: [Formulation sections] Formulation sections: while the MTZ and time-indexed models correctly encode split decisions and temporal dependencies, the paper does not demonstrate that the objective function and constraint set remain feasible when additional operational constraints (e.g., patient refusal of multiple caregivers or minimum visit durations) are added post hoc; this omission directly affects whether the reported savings survive realistic extensions.

    Authors: The two formulations are written in a modular linear form so that additional constraints can be appended without changing the existing objective or variable definitions. For instance, a minimum visit duration can be enforced by adjusting the split-part duration bounds, and patient refusal of multiple caregivers can be modeled by adding binary variables and inequalities that forbid certain caregiver combinations for a given patient. We will insert a short paragraph after the formulation sections illustrating these extensions and confirming that feasibility is preserved because all added constraints remain linear. We did not run new computational experiments with these specific constraints, as the study focused on the core task-splitting and synchronization features; the revision will therefore be limited to textual clarification rather than new numerical results. revision: partial

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: new MILP formulations and independent computational tests on instances

full rationale

The paper introduces two original MILP formulations (MTZ and time-indexed) for incorporating task-splitting decisions, along with pre-processing and heuristics. The central claims about reduced staff/costs are outputs of solving these models on test instances, not inputs redefined or fitted parameters renamed as predictions. No self-citations are load-bearing for the core modeling or results; the formulations are presented as newly developed. The derivation chain consists of standard MILP modeling steps followed by solver runs, which are self-contained and externally falsifiable via the instance data and objective values. This matches the default expectation of no circularity.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The paper relies on standard mixed-integer linear programming assumptions to encode routing, scheduling, and splitting decisions; no fitted parameters or new physical entities are introduced.

assumptions (1)
  • domain assumption Mixed integer linear programming is sufficient to model routing decisions, time windows, qualification requirements, and temporal dependencies arising from task splits.
    The two formulations are built directly on this modeling choice.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Task-splitting in home healthcare routing and scheduling." pith.science (2026). https://pith.science/paper/2406.19288

@misc{pith2026240619288,
  author       = {Pith},
  title        = {Pith review of: Task-splitting in home healthcare routing and scheduling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2406.19288}},
  note         = {Machine review of arXiv:2406.19288}
}
read the original abstract

This paper introduces the concept of task-splitting into home healthcare (HHC) routing and scheduling. It focuses on the design of routes and timetables for caregivers providing services at patients' homes. Task-splitting is the division of a (lengthy) patient visit into separate visits that can be performed by different caregivers at different times. The resulting split parts may have reduced caregiver qualification requirements, relaxed visiting time windows, or a shorter/longer combined duration. However, additional temporal dependencies can arise between them. To incorporate task-splitting decisions into the planning process, we introduce two different mixed integer linear programming formulations, a Miller-Tucker-Zemlin and a time-indexed variant. These formulations aim to minimize operational costs while simultaneously deciding which visits to split and imposing a potentially wide range of temporal dependencies. We also propose pre-processing routines for the time-indexed formulation and two heuristic procedures. These methods are embedded into the branch-and-bound approach as primal and improvement heuristics. The results of our computational study demonstrate the additional computational difficulty introduced by task-splitting possibilities and the associated additional synchronization, and the usefulness of the proposed heuristic procedures. From a planning perspective, our results indicate that integrating task-splitting decisions into the planning process reduces staff requirements, decreases HHC operational costs, and allows caregivers to spend relatively more time on tasks aligned with their qualifications.

Figures

Figures reproduced from arXiv: 2406.19288 by the authors.

Figure 1
Figure 1. Visualization of an HHCRSP-TS instance. Each house represents the location of an [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Optimality gaps of TI−, TI, and TI+ on the subset of instances feasible without task-splitting. visits are splittable. Consequently, the average number of patient visits included in an instance is more than doubled, while the number of (travel) decision variables after pre-processing and presolving is approximately six times as high. This large increase in the number of decision variables is due to the relaxed sched… view at source ↗
Figure 3
Figure 3. Optimality gaps of TI, TI+HTI, and TI+HMTZ. variants of the heuristic result in significant performance improvements, especially for instances of size 30 and 40. For small instances of size 20, we observe that they can be solved relatively well without the use of heuristics. Consequently, the observed differences between the three variants are minimal for these instances. Both versions with heuristics identify a fea… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Runtimes [s] until the first solution for [PITH_FULL_IMAGE:figures/full_fig_p033_4.png]
Figure 5
Figure 5. Figure 5: Relative gaps between the first solution found by [PITH_FULL_IMAGE:figures/full_fig_p033_5.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages

  1. [1]

    Dang, and A

    Afifi, S., D.-C. Dang, and A. Moukrim (2016, Mar). Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Optimization Letters\/ 10\/ (3), 511--525

    work page 2016

  2. [2]

    Ait Haddadene, S. R., N. Labadie, and C. Prodhon (2016, dec). A grasp ils for the vehicle routing problem with time windows, synchronization and precedence constraints. Expert Syst. Appl.\/ 66\/ (C), 274–294

    work page 2016

  3. [3]

    Ait Haddadene, S. R., N. Labadie, and C. Prodhon (2019). Bicriteria vehicle routing problem with preferences and timing constraints in home health care services. Algorithms\/ 12\/ (8)

    work page 2019

  4. [4]

    Kadrani, and R

    Bazirha, M., A. Kadrani, and R. Benmansour (2023, Jan). Stochastic home health care routing and scheduling problem with multiple synchronized services. Annals of Operations Research\/ 320\/ (2), 573--601

    work page 2023

  5. [5]

    Braekers, K., R. F. Hartl, S. N. Parragh, and F. Tricoire (2016). A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. European Journal of Operational Research\/ 248\/ (2), 428--443

    work page 2016

  6. [6]

    Bredström, D. and M. Rönnqvist (2007, 03). A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. SSRN Electronic Journal\/

    work page 2007

  7. [7]

    Bredström, D. and M. Rönnqvist (2008, November). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints . European Journal of Operational Research\/ 191\/ (1), 19--31

    work page 2008

  8. [8]

    Berkhout, R

    Clapper, Y., J. Berkhout, R. Bekker, and D. Moeke (2023). A model-based evolutionary algorithm for home health care scheduling. Computers & Operations Research\/ 150 , 106081

    work page 2023

Show all 50 references
  1. [9]

    Zhang, and M

    Dai, Z., Z. Zhang, and M. Chen (2023). The home health care location-routing problem with a mixed fleet and battery swapping stations using a competitive simulated annealing algorithm. Expert Systems with Applications\/ 228 , 120374

    2023

  2. [10]

    de Aguiar, A. R. P., T. R. P. Ramos, and M. I. Gomes (2023). Home care routing and scheduling problem with teams’ synchronization. Socio-Economic Planning Sciences\/ 86 , 101503

    2023

  3. [11]

    Grunder, A

    Decerle, J., O. Grunder, A. Hajjam, and O. Barakat (2019, 03). A hybrid memetic-ant colony optimization algorithm for the home health care problem with time window, synchronization and working time balancing. Swarm and Evolutionary Computation\/ 46 , 171--183

    2019

  4. [12]

    Martinez, and M.-L

    Di Mascolo , M., C. Martinez, and M.-L. Espinouse (2021). Routing and scheduling in home health care: A literature survey and bibliometric analysis. Computers & Industrial Engineering\/ 158 , 107255

    2021

  5. [13]

    Kolind, and J

    Dohn, A., E. Kolind, and J. Clausen (2009). The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research\/ 36\/ (4), 1145--1157

    2009

  6. [14]

    Dohn, A., M. S. Rasmussen, and J. Larsen (2011). The vehicle routing problem with time windows and temporal dependencies. Networks\/ 58\/ (4), 273--289

    2011

  7. [15]

    (2012, 08)

    Drexl, M. (2012, 08). Synchronization in vehicle routing—a survey of vrps with multiple synchronization constraints. Transportation Science\/ 46 , 297--316

    2012

  8. [16]

    Yücel (2022)

    Erdem, M., Çağrı Koç, and E. Yücel (2022). The electric home health care routing and scheduling problem with time windows and fast chargers. Computers & Industrial Engineering\/ 172 , 108580

    2022

  9. [17]

    Masmoudi, and P

    Euchi, J., M. Masmoudi, and P. Siarry (2022). Home health care routing and scheduling problems: a literature review. 4OR\/ 20\/ (3), 351--389

    2022

  10. [18]

    Zidi, and L

    Euchi, J., S. Zidi, and L. Laouamer (2020, 08). A hybrid approach to solve the vehicle routing problem with time windows and synchronized visits in-home health care. Arabian Journal for Science and Engineering\/ 45 , 10637–10652

    2020

  11. [19]

    Flisberg, and M

    Eveborn, P., P. Flisberg, and M. R \"o nnqvist (2006). Laps care—an operational system for staff planning of home care. European Journal of Operational Research\/ 171\/ (3), 962--976

    2006

  12. [20]

    Fikar, C. and P. Hirsch (2017). Home health care routing and scheduling: A review. Computers & Operations Research\/ 77 , 86--95

    2017

  13. [21]

    Desaulniers, M

    Fink, M., G. Desaulniers, M. Frey, F. Kiermaier, R. Kolisch, and F. Soumis (2019). Column generation for vehicle routing problems with multiple synchronization constraints. European Journal of Operational Research\/ 272\/ (2), 699--711

    2019

  14. [22]

    Frifita, S. and M. Masmoudi (2020). Vns methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties. International Transactions in Operational Research\/ 27\/ (1), 291--313

    2020

  15. [23]

    Leitner, and M

    Gouveia, L., M. Leitner, and M. Ruthmair (2017). Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. European Journal of Operational Research\/ 262\/ (3), 908--928

    2017

  16. [24]

    Leitner, and M

    Gouveia, L., M. Leitner, and M. Ruthmair (2019). Layered graph approaches for combinatorial optimization problems. Computers & Operations Research\/ 102 , 22--38

    2019

  17. [25]

    Grand View Research (GVR) (2023). Home Healthcare Market Size, Share & Trends Analysis Report By Component (Equipment, Services), By Indication (Cardiovascular Disorder & Hypertension, Diabetes & Kidney Disorders), By Region, And Segment Forecasts, 2023 - 2030

    2023

  18. [26]

    Pesant, and L.-M

    Hashemi Doulabi, H., G. Pesant, and L.-M. Rousseau (2020). Vehicle routing problems with synchronized visits and stochastic travel and service times: Applications in healthcare. Transportation Science\/ 54\/ (4), 1053--1072

    2020

  19. [27]

    Xiang, and W

    Li, Y., T. Xiang, and W. Y. Szeto (2021). Home health care routing and scheduling problem with the consideration of outpatient services. Transportation Research Part E: Logistics and Transportation Review\/ 152 , 102420

    2021

  20. [28]

    Tao, and X

    Liu, R., Y. Tao, and X. Xie (2019). An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Computers & Operations Research\/ 101 , 250--262

    2019

  21. [29]

    Dridi, H

    Liu, W., M. Dridi, H. Fei, and A. H. El Hassani (2021, nov). Hybrid metaheuristics for solving a home health care routing and scheduling problem with time windows, synchronized visits and lunch breaks. Expert Syst. Appl.\/ 183\/ (C)

    2021

  22. [30]

    Luo, Z., H. Qin, W. Zhu, and A. Lim (2016). Branch-and-price-and-cut for the manpower routing problem with synchronization constraints. Naval Research Logistics (NRL)\/ 63\/ (2), 138--171

    2016

  23. [31]

    Meisel, and C

    Mankowska, D., F. Meisel, and C. Bierwirth (2014, 06). The home health care routing and scheduling problem with interdependent services. Health care management science\/ 17 , 15--30

    2014

  24. [32]

    Mankowska, D. S. (2016). Synchronization in vehicle routing: Benders' decomposition for the home health care routing and scheduling problem. In H. Kotzab, J. Pannek, and K.-D. Thoben (Eds.), Dynamics in Logistics , Cham, pp.\ 159--169. Springer International Publishing

    2016

  25. [33]

    Jarboui, and R

    Masmoudi, M., B. Jarboui, and R. Borchani (2023, 04). Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits. Optimization Letters\/ , 1--33

    2023

  26. [34]

    Miller, C. E., A. W. Tucker, and R. A. Zemlin (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM)\/ 7\/ (4), 326--329

    1960

  27. [35]

    Catay, and T

    Nozir, S., B. Catay, and T. Unluyurt (2020). Crew constrained home health care routing problem with time windows and synchronized visits. In F. Calisir and O. Korhan (Eds.), Industrial Engineering in the Digital Disruption Era , Cham, pp.\ 87--96. Springer International Publishing

    2020

  28. [36]

    Tavakkoli-Moghaddam, M

    Oladzad-Abbasabady, N., R. Tavakkoli-Moghaddam, M. Mohammadi, and B. Vahedi-Nouri (2023). A bi-objective home care routing and scheduling problem considering patient preference and soft temporal dependency constraints. Engineering Applications of Artificial Intelligence\/ 119 , 105829

    2023

  29. [37]

    Abbasi, J

    Pahlevani, D., B. Abbasi, J. W. Hearne, and A. Eberhard (2022). A cluster-based algorithm for home health care planning: A case study in australia. Transportation Research Part E: Logistics and Transportation Review\/ 166 , 102878

    2022

  30. [38]

    Parragh, S. and K. Doerner (2018, 06). Solving routing problems with pairwise synchronization constraints. Central European Journal of Operations Research\/ 26 , 443--464

    2018

  31. [39]

    Picard, J.-C. and M. Queyranne (1978). The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research\/ 26\/ (1), 86--110

    1978

  32. [40]

    Riccardi, and K

    Polnik, M., A. Riccardi, and K. Akartunalı (2020, 08). A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits. Journal of the Operational Research Society\/ 72 , 1--16

    2020

  33. [41]

    Qiu, H., D. Wang, Y. Yin, T. C. E. Cheng, and Y. Wang (2022). An exact solution method for home health care scheduling with synchronized services. Naval Research Logistics (NRL)\/ 69\/ (5), 715--733

    2022

  34. [42]

    Rasmussen, M. S., T. Justesen, A. Dohn, and J. Larsen (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research\/ 219\/ (3), 598--610. Feature Clusters

    2012

  35. [43]

    Tavakkoli-Moghaddam, M

    Shahnejat-Bushehri, S., R. Tavakkoli-Moghaddam, M. Boronoos, and A. Ghasemkhani (2021). A robust home health care routing-scheduling problem with temporal dependencies under uncertainty. Expert Systems with Applications\/ 182 , 115209

    2021

  36. [44]

    Shi, Y., Y. Zhou, W. Ye, and Q. Q. Zhao (2020). A relative robust optimization for a vehicle routing problem with time-window and synchronized visits considering greenhouse gas emissions. Journal of Cleaner Production\/ 275 , 124112

    2020

  37. [45]

    Marques, P

    Soares, R., A. Marques, P. Amorim, and S. N. Parragh (2024). Synchronisation in vehicle routing: Classification schema, modelling framework and literature review. European Journal of Operational Research\/ 313\/ (3), 817--840

    2024

  38. [46]

    Gewijzigde en verlengde cao verpleeg-, verzorgingshuizen, thuiszorg en jeugdgezondheidszorg 2022-2024

    Sociaal Overleg Verpleeg, Verzorgingshuizen en Thuiszorg (SOVVT) (2023). Gewijzigde en verlengde cao verpleeg-, verzorgingshuizen, thuiszorg en jeugdgezondheidszorg 2022-2024

    2023

  39. [47]

    Aging in Place

    Wiles, J. L., A. Leibing, N. Guberman, J. Reeve, and R. E. S. Allen (2011, 10). The Meaning of “Aging in Place” to Older People . The Gerontologist\/ 52\/ (3), 357--366

    2011

  40. [48]

    Li, and W

    Xiang, T., Y. Li, and W. Y. Szeto (2023). The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction. International Transactions in Operational Research\/ 30\/ (1), 39--69

    2023

  41. [49]

    Yadav, N. and A. Tanksale (2022). An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact. European Journal of Operational Research\/ 303\/ (3), 1100--1125

    2022

  42. [50]

    Yin, Y., X. Liu, F. Chu, and D. Wang (2023, 04). An exact algorithm for the home health care routing and scheduling with electric vehicles and synergistic-transport mode. Annals of Operations Research\/

    2023

Pith tools

Reviewed May 24, 2026 · model on record in the stance chip above.