Periodic Scheduling and Packing Problems
Data Structures and Algorithms
2020-11-04 v1 Computational Complexity
Abstract
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.
Keywords
Cite
@article{arxiv.2011.01898,
title = {Periodic Scheduling and Packing Problems},
author = {Claire Hanen and Zdenek Hanzalek},
journal= {arXiv preprint arXiv:2011.01898},
year = {2020}
}