Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh 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
Randomized online scheduling on two uniform machines
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
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
A manifesto for the computational method
Theoretical Computer Science
Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of 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
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)
On-line multi-threaded scheduling
Journal of Scheduling - Special issue: On-line algorithm part I
Barely random algorithms for multiprocessor scheduling
Journal of Scheduling - Special issue: On-line scheduling
Experimental analysis of online algorithms for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
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
Scheduling resource allocation with timeslot penalty for changeover
Theoretical Computer Science
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 with Bounded Migration
Mathematics of Operations Research
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
Discrete Applied Mathematics
Minimizing the maximum starting time on-line
Information and Computation
Randomized priority algorithms
Theoretical Computer Science
Online rescheduling of multiple picking agents for warehouse management
Robotics and Computer-Integrated Manufacturing
Online scheduling with rearrangement on two related machines
Theoretical Computer Science
Competitive ratio of List Scheduling on uniform machines and randomized heuristics
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
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
Online scheduling with rejection and withdrawal
Theoretical Computer Science
A resource scheduling strategy for the CFD application on the grid
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Semi-online scheduling revisited
Theoretical Computer Science
Semi on-line algorithms for the partition problem
Operations Research Letters
Semi-online scheduling with decreasing job sizes
Operations Research Letters
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Operations Research Letters
Randomized on-line scheduling on three processors
Operations Research 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
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
| Hi-index | 0.01 |