Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Eliminating migration in multi-processor scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improvements in throughout maximization for real-time scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximating the Advertisement Placement Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Approximating the Advertisement Placement Problem
Journal of Scheduling
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Computers and Industrial Engineering
A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Single-Machine Scheduling Problems with Generalized Preemption
INFORMS Journal on Computing
Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Competitive Two-Agent Scheduling and Its Applications
Operations Research
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Algorithms and complexity for periodic real-time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A truthful mechanism for value-based scheduling in cloud computing
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
Computers and Operations Research
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property
Mathematical and Computer Modelling: An International Journal
Operations Research Letters
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Operations Research Letters
On-line scheduling on a single machine: maximizing the number of early jobs
Operations Research Letters
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Operations Research Letters
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Optimality proof of the Kise---Ibaraki---Mine algorithm
Journal of Scheduling
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms (TALG)
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Theory of Computing Systems
Hi-index | 0.00 |