Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
An optimal online algorithm for scheduling two machines with release times
Theoretical Computer Science
On randomized online scheduling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Scheduling Two Machines with Release Times
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
Barely random algorithms for multiprocessor scheduling
Journal of Scheduling - Special issue: On-line scheduling
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
Online scheduling of splittable tasks
ACM Transactions on Algorithms (TALG)
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
List's worst-average-case or WAC ratio
Journal of Scheduling
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Computers and Operations Research
Scheduling unit length jobs on parallel machines with lookahead information
Journal of Scheduling
Online scheduling with rejection and withdrawal
Theoretical Computer Science
Semi-online scheduling revisited
Theoretical Computer Science
Computer Science Review
New lower and upper bounds for on-line scheduling
Operations Research Letters
Semi on-line algorithms for the partition problem
Operations Research Letters
Semi-online scheduling with decreasing job sizes
Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters
On the value of job migration in online makespan minimization
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
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 problems on a small number of machines
Journal of Scheduling
Lower bounds for online makespan minimization on a small number of related machines
Journal of Scheduling
| Hi-index | 0.01 |