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
Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science
Preemptive Online Scheduling with Reordering
SIAM Journal on Discrete Mathematics
Online scheduling with reassignment
Operations Research Letters
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
Several semi-online scheduling problems on two identical machines with combined information
Theoretical Computer Science
Semi-online hierarchical scheduling problems with buffer or rearrangements
Information Processing Letters
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.90 |