Abstract
AbstractThis 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$$
m
>
1
.
Funder
Carnegie Mellon University
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. Azar, Y., Cohen, S.: An improved algorithm for online machine minimization. Oper. Res. Lett. 46(1), 128–133 (2018)
2. Baruah, S.K., Koren, G., Mao, D., Mishra, B., Raghunathan, A., Rosier, L.E., Shasha, D.E., Wang, F.: On the competitiveness of on-line real-time task scheduling. Real Time Syst. 4(2), 125–144 (1992)
3. Chen, L., Eberle, F., Megow, N., Schewior, K., Stein, C.: A general framework for handling commitment in online throughput maximization. Math. Program. 183(1), 215–247 (2020)
4. Chen, L., Megow, N., Schewior, K.: An o(log m)-competitive algorithm for online machine minimization. SIAM J. Comput. 47(6), 2057–2077 (2018)
5. Eberle, F., Megow, N., Schewior, K.: Optimally handling commitment issues in online throughput maximization. In: F. Grandoni, G. Herman, P. Sanders (eds.) European Symposium on Algorithms), LIPIcs, vol. 173, pp. 41:1–41:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)