具有部分预测的非先知调度
Non-clairvoyant Scheduling with Partial Predictions
AI总结:
本文研究仅有 B/n 个作业规模可预测的非先知调度,给出完美预测下近优下界与算法,并提出兼顾鲁棒性、一致性和平滑性的学习增强算法,揭示一致性与平滑性的新权衡。
摘要:
非先知调度问题在学习增强算法领域重新引起关注,其中决策者拥有预测,但这些预测没有任何质量保证。在实际场景中,由于成本或数据限制,获取预测的能力可能仅限于特定实例。我们的研究聚焦于算法只能获得 n 个作业中 B 个作业规模预测的情形。我们首先在完美预测情况下建立了接近最优的下界和算法。随后,我们提出一种学习增强算法,该算法满足鲁棒性、一致性和平滑性标准,并揭示了在预测数量受限的情形中,一致性与平滑性之间固有的一种新的权衡。
英文摘要:
The non-clairvoyant scheduling problem has gained new interest within learning-augmented algorithms, where the decision-maker is equipped with predictions without any quality guarantees. In practical settings, access to predictions may be reduced to specific instances, due to cost or data limitations. Our investigation focuses on scenarios where predictions for only $B$ job sizes out of $n$ are available to the algorithm. We first establish near-optimal lower bounds and algorithms in the case of perfect predictions. Subsequently, we present a learning-augmented algorithm satisfying the robustness, consistency, and smoothness criteria, and revealing a novel tradeoff between consistency and smoothness inherent in the scenario with a restricted number of predictions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。