Rejecting jobs to minimize load and maximum flow-time

J. Comput. Syst. Sci., Volume 91, 2018, Pages 42-68.

Cited by: 3|Bibtex|Views4
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Online algorithms are usually analyzed using the notion of competitive ratio which compares the solution obtained by the algorithm to that obtained by an online adversary for the worst possible input sequence. Often this measure turns out to be too pessimistic, and one popular approach especially for scheduling problems has been that of \...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments