New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
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
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
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
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
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
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
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
Journal of Scheduling
Semi-on-line multiprocessor scheduling with given total processing time
Theoretical Computer Science
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics - Special issue: Max-algebra
Semi-online scheduling problems on two identical machines with inexact partial information
Theoretical Computer Science
Semi on-line scheduling on three processors with known sum of the tasks
Journal of Scheduling
On-line scheduling of parallel jobs on two machines
Journal of Discrete Algorithms
List's worst-average-case or WAC ratio
Journal of Scheduling
Online parallel machines scheduling with two hierarchies
Theoretical Computer Science
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics
Return of the boss problem: competing online against a non-adaptive adversary
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Online malleable job scheduling for m≤3
Information Processing Letters
Semi-online scheduling with known partial information about job sizes on two identical machines
Theoretical Computer Science
Online scheduling with rejection and withdrawal
Theoretical Computer Science
Online scheduling on three uniform machines
Discrete Applied Mathematics
Semi-online problems on identical machines with inexact partial information
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Semi-online scheduling revisited
Theoretical Computer Science
Online scheduling with reassignment
Operations Research Letters
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
More on online bin packing with two item sizes
Discrete Optimization
Minimum partition of an independence system into independent sets
Discrete Optimization
Discrete Optimization
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
Several semi-online scheduling problems on two identical machines with combined information
Theoretical Computer Science
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.03 |