National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172
Bartal, Y. ; Chin, F. Y. L. ; Chrobak, M. ; Fung, S. P. Y. ; Jawor, W. ; Lavi, R. ; Sgall, Jiří ; Tichý, Tomáš
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.