Problem
Research questions and friction points this paper is trying to address.
unknown length
job scheduling
inspection
Test or Run? Scheduling Jobs of Unknown Length
🤖 AI Summary
研究未知长度任务的调度问题，通过设计在最坏情况和实例最优框架下的简单算法来决定何时检查任务、何时开始执行。
📝 Abstract
A machine faces many jobs whose lengths are hidden. Spending one unit of time to inspect a job may reveal a short job that should be finished now, or it may reveal nothing useful
while every other job waits. When should the machine keep looking, and when should it start working?
We study natural variants of this question and provide optimal algorithms in both the worst-case and instance-optimal frameworks. The resulting algorithms are often quite simple,
which may make them useful in practice.
Innovation
Methods, ideas, or system contributions that make the work stand out.
unknown job lengths
scheduling
optimal algorithms
worst-case analysis
instance-optimality
🔎 Similar Papers
No similar papers found.
