This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on $m$ identical machines. The main result is an $O(1)$ competitive deterministic algorithm for any number of machines $m >1$.

翻译：本文考虑了在网上安排工作的基本问题,预先将工作排在日程上,以便在最后期限前尽可能增加完成的相同机器的工作数量,主要结果是为任何几台机器提供1美元以上1美元的竞争性确定算法。