@inbook{7ef03edbf05342c1982a8e336ae09a87,

title = "Online competitive algorithms for maximizing weighted throughput of unit jobs",

abstract = "We study an online scheduling problem for unit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight. The goal is to maximize the weighted throughput, that is the total weight of scheduled jobs. We first give a randomized algorithm RMix with competitive ratio of e/(e -1) ≈1.582. Then we consider s-bounded instances where the span of each job is at most s. We give a 1.25-competitive randomized algorithm for 2-bounded instances, and a deterministic algorithm EDFα, whose competitive ratio on s-bounded instances is at most 2 -2/s + o(l/s). For 3-bounded instances its ratio is φ≈ 1.618, matching the lower bound. We also consider 2-uniform instances, where the span of each job is 2. We prove a lower bounds for randomized algorithms and deterministic memoryless algorithms. Finally, we consider the multiprocessor case and give an 1/(1 -(m/m+1) M)-competitive algorithm for M processors. We also show improved lower bounds for the general and 2-uniform cases.",

author = "Yair Bartal and Chin, {Francis Y.L.} and Marek Chrobak and Fung, {Stanley P.Y.} and Wojciech Jawor and Ron Lavi and Ji{\^r}{\'i} Sgall and Tom{\'a}ŝ Tichy",

year = "2004",

doi = "10.1007/978-3-540-24749-4_17",

language = "American English",

isbn = "9783540212362",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "187--198",

editor = "Volker Diekert and Michel Habib",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}