Online in-time service problem with minimal server assignment
- 97 Downloads
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.
KeywordsScheduling 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.
- 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