IDEAS home Printed from https://ideas.repec.org/a/kap/hcarem/v23y2020i2d10.1007_s10729-019-09479-z.html
   My bibliography  Save this article

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

Author

Listed:
  • Marouene Chaieb

    (Prince Sattam bin Abdulaziz University
    LARODEC)

  • Jaber Jemai

    (Information Systems Department)

  • Khaled Mellouli

    (LARODEC)

Abstract

Solving NP-hard Combinatorial Optimization Problems (COP) is a complex process as it deals with difficult cases essentially when using classical modeling techniques that may fail in handling real-life problems efficiently. In this context, Hierarchical Optimization Models (HOM) can be viewed as an effective alternative for modeling numerous difficult optimization problems. Their efficiency is explained by their ability to relax the COP complexity by decomposing it hierarchically into a set of weaker and easier interconnected subproblems. Recently, the HOM has been effectively used to model NP-hard COPs in many fields such as healthcare, supply chain, transport, economic, etc. In this paper, we will use the HOM to model the Home Health Care Scheduling Problem (HCSP). The proposed model will divide the HCSP into three subproblems namely the grouping, the assignment, and the routing subproblems. The result of the decomposition phase is represented using a Hierarchical Directed Acyclic Graph (HDAG) showing a graph of interconnected subproblems as nodes and their decomposition and/or dependency links as edges. The paper embeds also a generic algorithm for traversing the obtained HDAG to visit all nodes in the order satisfying the decomposition and dependency edges. Each visited problem is then solved using a specific algorithm. The developed approach was applied to solve a real-life instance from Zealand Company and the obtained results outperform other known approaches.

Suggested Citation

  • Marouene Chaieb & Jaber Jemai & Khaled Mellouli, 2020. "A decomposition - construction approach for solving the home health care scheduling problem," Health Care Management Science, Springer, vol. 23(2), pages 264-286, June.
    • Handle: RePEc:kap:hcarem:v:23:y:2020:i:2:d:10.1007_s10729-019-09479-z
    DOI: 10.1007/s10729-019-09479-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10729-019-09479-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10729-019-09479-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Klaus-Dieter Rest & Patrick Hirsch, 2016. "Daily scheduling of home health care services using time-dependent public transport," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 495-525, September.
    2. Rajendra Dulal, 2017. "Cost efficiency of nursing homes: do five-star quality ratings matter?," Health Care Management Science, Springer, vol. 20(3), pages 316-325, September.
    3. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    4. Vivian G. Valdmanis & Michael D. Rosko & Hervé Leleu & Dana B. Mukamel, 2017. "Assessing overall, technical, and scale efficiency among home health care agencies," Health Care Management Science, Springer, vol. 20(2), pages 265-275, June.
    5. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    6. Dorota Mankowska & Frank Meisel & Christian Bierwirth, 2014. "The home health care routing and scheduling problem with interdependent services," Health Care Management Science, Springer, vol. 17(1), pages 15-30, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jalel Euchi & Malek Masmoudi & Patrick Siarry, 2022. "Home health care routing and scheduling problems: a literature review," 4OR, Springer, vol. 20(3), pages 351-389, September.
    2. Ignacio A. Sepúlveda & Maichel M. Aguayo & Rodrigo De la Fuente & Guillermo Latorre-Núñez & Carlos Obreque & Camila Vásquez Orrego, 2024. "Scheduling mobile dental clinics: A heuristic approach considering fairness among school districts," Health Care Management Science, Springer, vol. 27(1), pages 46-71, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nasir, Jamal Abdul & Kuo, Yong-Hong, 2024. "Stochastic home care transportation with dynamically prioritized patients: An integrated facility location, fleet sizing, and routing approach," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    2. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    3. Mohamed Cissé & Semih Yalçindag & Yannick Kergosien & Evren Sahin & Christophe Lenté & Andrea Matta, 2017. "OR problems related to Home Health Care: A review of relevant routing and scheduling problems," Post-Print hal-01736714, HAL.
    4. Gang Du & Xi Liang & Chuanwang Sun, 2017. "Scheduling Optimization of Home Health Care Service Considering Patients’ Priorities and Time Windows," Sustainability, MDPI, vol. 9(2), pages 1-22, February.
    5. de Aguiar, Ana Raquel Pena & Ramos, Tânia Rodrigues Pereira & Gomes, Maria Isabel, 2023. "Home care routing and scheduling problem with teams’ synchronization," Socio-Economic Planning Sciences, Elsevier, vol. 86(C).
    6. Castillo, Cristian & Alvarez-Palau, Eduard J. & Calvet, Laura & Panadero, Javier & Viu-Roig, Marta & Serena-Latre, Anna & Juan, Angel A., 2024. "Home healthcare in Spanish rural areas: Applying vehicle routing algorithms to health transport management," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    7. Zhan, Yang & Wang, Zizhuo & Wan, Guohua, 2021. "Home service routing and appointment scheduling with stochastic service times," European Journal of Operational Research, Elsevier, vol. 288(1), pages 98-110.
    8. Sophie N. Parragh & Karl F. Doerner, 2018. "Solving routing problems with pairwise synchronization constraints," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 443-464, June.
    9. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
    10. Mohammed Bazirha & Abdeslam Kadrani & Rachid Benmansour, 2023. "Stochastic home health care routing and scheduling problem with multiple synchronized services," Annals of Operations Research, Springer, vol. 320(2), pages 573-601, January.
    11. Amir M. Fathollahi-Fard & Abbas Ahmadi & Behrooz Karimi, 2021. "Multi-Objective Optimization of Home Healthcare with Working-Time Balancing and Care Continuity," Sustainability, MDPI, vol. 13(22), pages 1-33, November.
    12. Andre A. Cire & Adam Diamant, 2022. "Dynamic scheduling of home care patients to medical providers," Production and Operations Management, Production and Operations Management Society, vol. 31(11), pages 4038-4056, November.
    13. Isabel Méndez-Fernández & Silvia Lorenzo-Freire & Ignacio García-Jurado & Julián Costa & Luisa Carpente, 2020. "A heuristic approach to the task planning problem in a home care business," Health Care Management Science, Springer, vol. 23(4), pages 556-570, December.
    14. Shanxiu Jiang & Li Luo, 2019. "Online in-time service problem with minimal server assignment," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 114-122, January.
    15. Jamal Abdul Nasir & Chuangyin Dang, 2018. "Solving a More Flexible Home Health Care Scheduling and Routing Problem with Joint Patient and Nursing Staff Selection," Sustainability, MDPI, vol. 10(1), pages 1-22, January.
    16. Christian Fikar & Angel A. Juan & Enoc Martinez & Patrick Hirsch, 2016. "A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 10(3), pages 323-340.
    17. Gomes, Maria Isabel & Ramos, Tânia Rodrigues Pereira, 2019. "Modelling and (re-)planning periodic home social care services with loyalty and non-loyalty features," European Journal of Operational Research, Elsevier, vol. 277(1), pages 284-299.
    18. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    19. René Bekker & Dennis Moeke & Bas Schmidt, 2019. "Keeping pace with the ebbs and flows in daily nursing home operations," Health Care Management Science, Springer, vol. 22(2), pages 350-363, June.
    20. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:hcarem:v:23:y:2020:i:2:d:10.1007_s10729-019-09479-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.