Journal of Combinatorial Optimization

, Volume 37, Issue 1, pp 114–122 | Cite as

Online in-time service problem with minimal server assignment

  • Shanxiu JiangEmail author
  • Li Luo


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.


Scheduling Home health care In-time service Online algorithm Competitive ratio 



This work was partially supported by the National Natural Science Foundation of China under Grants 71131006, 71532007, and 71172197.


  1. Akjiratikarl C, Yenradee P, Drake PR (2007) PSO-based algorithm for home care worker scheduling in the UK. Comput Ind Eng 53(4):559–583CrossRefGoogle Scholar
  2. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis (Chapter 1). Cambridge University Press, Cambridge, pp 2–5zbMATHGoogle Scholar
  3. Bredstrm D, Rnnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19–31CrossRefGoogle Scholar
  4. Chen L, Megow N, Schewior K (2016) An \(O(\log m)\)-competitive algorithm for online machine minimization. In: Twenty-Seventh ACM-SIAM Symposium on Discrete Algorithms. SIAMGoogle Scholar
  5. Eveborn P, Flisberg P, Rnnqvist M (2006) LAPS CARE—an operational system for staff planning of home care. Eur J Oper Res 171(3):962–976CrossRefzbMATHGoogle Scholar
  6. Jaillet P, Lu X (2014) Online traveling salesman problems with service flexibility. Networks 64(2):84–95MathSciNetCrossRefzbMATHGoogle Scholar
  7. Manasse MS, McGeoch LA, Sleator DD (1990) Competitive algorithms for server problems. J Algorithms 11:208–230MathSciNetCrossRefzbMATHGoogle Scholar
  8. Mankowska DS, Meisel F, Bierwirth C (2014) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17(1):15–30CrossRefGoogle Scholar
  9. Wen X, Xu Y, Zhang H (2015) Online traveling salesman problem with deadlines and service flexibility. J Comb Optim 30(3):545–562MathSciNetCrossRefzbMATHGoogle Scholar
  10. Xu Y, Li H, He C et al (2015) The online k-server problem with max-distance objective. J Comb Optim 29(4):836–846MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  1. 1.School of BusinessSichuan UniversityChengduPeople’s Republic of China

Personalised recommendations