Abstract
Motivated by issues raised from data broadcast and networks using ATM and TCP/IP, we consider an online scheduling problem on a single machine. In the problem, each job i is revealed at release time r i, has processing time p i, deadline d i and weight w i . Preemption is allowed and there are two models of preemption: preemption with restart and preemption with resume. The goal is to maximize the throughput - the total weight of all jobs completed on time. In the paper, we consider the problem where all processing time of jobs are equal and present improved algorithms which achieve 4.24-competitive in both models of preemption. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Nguyen Kim, T. (2011). Improved online scheduling in maximizing throughput of equal length jobs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6651 LNCS, pp. 429–442). Springer Verlag. https://doi.org/10.1007/978-3-642-20712-9_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
