Output details
11 - Computer Science and Informatics
University of Leicester
Article title
Max-min online allocations with a reordering buffer
Type
D - Journal article
Title of journal
SIAM Journal on Discrete Mathematics
Article number
-
Volume number
25
Issue number
3
First page of article
1230
ISSN of journal
0895-4801
Year of publication
2011
URL
-
Number of additional authors
2
Additional information
<12>Our SIDMA paper (preliminary version ICALP'10) is one of the first to study reordering buffers. This is a new model in online scheduling, introduced by Englert et al. (FOCS'08). We were among the first to study it, using the min-max objective function for the quality of the schedule. This is a classical measure of fairness. The work features in two recent state-of-the art surveys, one on online and semi-online scheduling in general, and the second on reordering buffers (the latter refers to our paper as a "comprehensive study").
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
