Online in-time service problem with minimal server assignment

Shanxiu Jiang () and Li Luo
Additional contact information
Shanxiu Jiang: Sichuan University
Li Luo: Sichuan University

Journal of Combinatorial Optimization, 2019, vol. 37, issue 1, No 7, 114-122

Abstract: 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.

Keywords: Scheduling; Home health care; In-time service; Online algorithm; Competitive ratio (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0215-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:1:d:10.1007_s10878-017-0215-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0215-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().