IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i1d10.1007_s10878-017-0215-0.html
   My bibliography  Save this article

Online in-time service problem with minimal server assignment

Author

Listed:
  • Shanxiu Jiang

    (Sichuan University)

  • Li Luo

    (Sichuan University)

Abstract

This paper proposes an online in-time service problem with minimal server assignment where the objective is to minimize the number of used servers. We mainly focus on the scenario where an offline optimal solution requires exactly two servers. For the case with general metric space, we present a 3 / 2-competitive algorithm, and also prove a matching lower bound. For a special case where the metric space is the positive axis, we present an online algorithm being optimally 1-competitive.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0215-0
    DOI: 10.1007/s10878-017-0215-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0215-0
    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/s10878-017-0215-0?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. Xingang Wen & Yinfeng Xu & Huili Zhang, 2015. "Online traveling salesman problem with deadlines and service flexibility," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 545-562, October.
    2. 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.
    3. Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
    4. Yinfeng Xu & Hongmei Li & Changzheng He & Li Luo, 2015. "The online $$k$$ k -server problem with max-distance objective," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 836-846, May.
    5. 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)

    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. 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).
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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).
    12. 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.
    13. 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.
    14. Biao Yuan & Zhibin Jiang, 2017. "Disruption Management for the Real-Time Home Caregiver Scheduling and Routing Problem," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
    15. 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.
    16. 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.
    17. Jamal Abdul Nasir & Chuangyin Dang, 2020. "Quantitative thresholds based decision support approach for the home health care scheduling and routing problem," Health Care Management Science, Springer, vol. 23(2), pages 215-238, June.
    18. Mike Hewitt & Maciek Nowak & Nisha Nataraj, 2016. "Planning Strategies for Home Health Care Delivery," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-26, October.
    19. Cinar, Ahmet & Salman, F. Sibel & Bozkaya, Burcin, 2021. "Prioritized single nurse routing and scheduling for home healthcare services," European Journal of Operational Research, Elsevier, vol. 289(3), pages 867-878.
    20. 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.

    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:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0215-0. 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.