arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.29037cs.DS
收藏

非先知调度的近最优一致性-鲁棒性界

Near-Optimal Consistency-Robustness Bounds for Non-Clairvoyant Scheduling

Johns Hopkins University(约翰斯·霍普金斯大学);CUHK(SZ)(香港中文大学(深圳))

Sizhe Li, Nicolas Christianson, Tongxin Li

AI总结:

针对单机非先知调度的一致性-鲁棒性权衡问题,本文提出新的下界与算法,给出近最优刻画,缩小了多项式差距,还可使算法容错,在预测误差有界时保持近最优权衡。

摘要:

我们研究了具有预测处理时间的单机非先知调度的最优一致性-鲁棒性权衡的刻画问题。对于固定数量的作业$n$,Wei和Zhang(2020)建立了可实现的一致性-鲁棒性权衡的下界,该下界仅在少数受限情形下是紧的,从而留下了一般$n$下最优权衡未解决的问题。Benomar等人(2025)引入了一种不同的最坏情况-$n$机制,他们应用前者的工作构造证明,对于$\lambda \in (0, 1)$,任何$(1+\lambda)$一致算法必须是$1 + \Omega(\sqrt{1/\lambda})$鲁棒的。另一方面,已知的最佳上界给出$(1+\lambda)$一致性和$1+O(1/\lambda)$鲁棒性,留下了一个多项式差距。在这项工作中,我们使用多阶段对抗构造开发了一个新的下界,并提出了一个新算法,二者共同给出了一致性-鲁棒性权衡的近最优刻画:对于每个$n$,我们的上界与下界的乘积因子为$3/2$,因此我们的算法与在线最优的乘积因子为$3/2$。特别地,我们的下界表明,当$n \to \infty$时,任何$(1+\lambda)$一致算法必须具有至少$1/\sqrt{\lambda}$的鲁棒性,而我们的算法对于任何$n$实现了至多$\frac{1}{2}+\sqrt{\frac{5}{4}+1/\lambda}$的鲁棒性,当$\lambda \downarrow 0$时在主项上匹配下界;我们的上界还缩小了最坏情况-$n$机制中的多项式差距。我们还展示了如何使我们的算法具有容错性,在预测误差有界时,仅产生略微下降的性能,同时保持近最优的一致性-鲁棒性权衡。

英文摘要:

We study the problem of characterizing the optimal consistency--robustness tradeoff for single-machine non-clairvoyant scheduling with predicted processing times. For a fixed number of jobs $n$, Wei and Zhang (2020) established a lower bound on the achievable consistency--robustness tradeoff which is known to be tight only in a few restrictive cases, leaving the optimal tradeoff for general $n$ unresolved. A different worst-case-$n$ regime was introduced by Benomar et al. (2025), who applied the former work's construction to show that for $λ\in (0, 1)$, any $(1+λ)$-consistent algorithm must be $1 + Ω(\sqrt{1/λ})$-robust. On the other hand, the best known upper bound gives $(1+λ)$-consistency and $1+O(1/λ)$-robustness, leaving a polynomial gap. In this work, we develop a new lower bound using a multi-stage adversarial construction and a new algorithm that together give a near-optimal characterization of the consistency--robustness tradeoff: for every $n$, our upper bound is within a multiplicative factor $3/2$ of our lower bound, and thus our algorithm is within a multiplicative factor $3/2$ of the online optimal. In particular, our lower bound shows that any $(1+λ)$-consistent algorithm must have robustness at least $1/\sqrtλ$ as $n \to \infty$, while our algorithm achieves robustness at most $\frac{1}{2}+\sqrt{\frac{5}{4}+1/λ}$ for any $n$, matching the lower bound in the leading term as $λ\downarrow 0$; our upper bound also closes the polynomial gap in the worst-case-$n$ regime. We additionally show how our algorithm can be made error-tolerant, preserving the near-optimal consistency-robustness tradeoff while incurring only slightly degraded performance under bounded prediction errors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑