6 search results - page 1 / 2 » Separating online scheduling algorithms with the relative wo... |
JCO
2006
13 years 11 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
SWAT
2004
Springer
14 years 4 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
JCSS
2007
13 years 11 months ago
2007
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
WADS
2009
Springer
14 years 5 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
JCO
2010
13 years 9 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...