测试还是运行？调度长度未知的作业
Test or Run? Scheduling Jobs of Unknown Length
AI总结：
针对调度长度未知作业的问题，研究其自然变体，在最坏情况和实例最优框架中提出简单实用的最优算法。
AI中文摘要：
一台机器面临许多长度未知的作业。花费1个单位时间检查一项作业，可能会揭示一项应立即完成的短作业，也可能在其他所有作业等待时，揭示不到任何有用信息。机器应何时继续检查，何时开始工作？我们研究该问题的自然变体，并在最坏情况和实例最优框架中提供最优算法。所得算法通常十分简单，或可在实际中应用。
英文摘要：
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.
