Online Service with Per-Batch Maximum Delay

2026-08-19

AI Summary

研究在线服务中每批次最大延迟问题，通过动态规划和竞争比率分析，在不同场景下提出有效算法以优化服务路径和等待时间。

Abstract

We study online service with one maximum-waiting-time charge per service batch. Requests arrive at points of a finite metric, and a mobile server pays for its movement and, for each service walk, the maximum waiting time among the requests served by that walk. We distinguish elective service, where an encountered request may be left pending, from automatic service, where every encounter serves it. Although the two semantics have different optimal schedule structures, we prove that their offline optimal values are equal. On a finite line and on an explicitly represented weighted tree, the common offline value is computable by polynomial-time dynamic programming, whereas exact optimization on arbitrary finite metrics is NP-hard. For the online problem, we prove a metric-independent group-trajectory certificate lemma that charges spatially separated request groups to two parity classes of time windows. It yields deterministic polynomial-time competitive ratios 10 on a line, 12 on a weighted tree, and 20 on an arbitrary finite metric, under both service semantics. With an exact metric-Steiner-tree oracle, the general-metric ratio improves to 12. The polynomial algorithm uses a half-scaled running maximum of terminal-MST weights; the running maximum is necessary because terminal MST weight is not monotone under new arrivals. A fixed two-point line gives a deterministic visible-service lower bound of 3 for every metric class above. Finally, when request locations are hidden until visited, dyadic exploration is 84-competitive on a known finite line. This phenomenon is line-specific: one hidden request gives deterministic and randomized lower bounds 3 and 2 on a line, while a d-leaf unit star gives lower bounds 2d-1 and d.

Problem

• online service
• maximum waiting time
• service batch
• mobile server
• finite metric

Innovation

• maximum-waiting-time charge
• elective service
• automatic service
• group-trajectory certificate lemma
• competitive ratios