An improved competitive algorithm for reordering buffer management
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Preemptive Online Scheduling with Reordering
SIAM Journal on Discrete Mathematics
Semi-online scheduling revisited
Theoretical Computer Science
Online scheduling with one rearrangement at the end: Revisited
Information Processing Letters
Online minimum makespan scheduling with a buffer
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
SIGACT news online algorithms column 21: APPROX and ALGO
ACM SIGACT News
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters
Dynamic proxy-assisted scalable broadcasting of videos for heterogeneous environments
Multimedia Tools and Applications
Recent advances for a classical scheduling problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Semi-online scheduling with two GoS levels and unit processing time
Theoretical Computer Science
Hi-index | 0.00 |
N/A