Abstract
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival times, arbitrary job deadlines, and unit job execution time. For this problem, we present a lower bound 2.09 on the competitive factor of any online algorithms, followed by designing a 5.2-competitive online algorithm. We would also like to point out a false claim made in an existing paper of Shi and Ye regarding a further restricted case of the considered problem. To the best of our knowledge, what we present is the first concrete result concerning online machine-minimizing job scheduling with arbitrary job arrival times and deadlines. ©Springer-Verlag 2012.
Cite
CITATION STYLE
Kao, M. J., Chen, J. J., Rutter, I., & Wagner, D. (2012). Competitive design and analysis for machine-minimizing job scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 75–84). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
