论文标题
定期安排和包装问题
Periodic Scheduling and Packing Problems
论文作者
论文摘要
本文是由自动驾驶汽车的周期性数据传输激励的。我们考虑了一台或几台机器上的定期任务（不同时期）。在回顾了有关该主题的文献之后，我们设法概括了Lukasiewicz等人的结果。 （即，定期调度的等效性与两个时期的功率和特殊的2D垃圾箱的功率）到谐波时期。此外，我们使用Coffman，Garey和Johnson的旧结果来获得近似算法。
This paper is motivated by periodic data transmission in autonomous cars. We considered periodic tasks (with different periods) on one or several machines. After reviewing the literature on the subject, we managed to generalize a result of Lukasiewicz et al. (i.e., the equivalence of periodic scheduling with the power of two periods and special 2D bin packing) to harmonic periods. Furthermore, we use quite old results by Coffman, Garey, and Johnson to get an approximation algorithm.
