Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Minimizing weighted completion time on a single machine
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation in stochastic scheduling: the power of LP-based priority policies
Journal of the ACM (JACM)
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On-line scheduling of a single machine to minimize total weighted completion time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds on precedence-constrained scheduling for parallel processors
Information Processing Letters
Multimedia Information Delivery Over Wireless Channels
Multimedia Tools and Applications
Data migration to minimize the average completion time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Resource Scheduling for Composite Multimedia Objects
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Scheduling under uncertainty: Optimizing against a randomizing adversary
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Convex Quadratic Programming Relaxations for Network Scheduling Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Global Optimization
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Bi-criteria algorithm for scheduling jobs on cluster platforms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Data migration to minimize the total completion time
Journal of Algorithms
Evaluation of grid scheduling strategies through NSGrid: a network-aware grid simulator
Neural, Parallel & Scientific Computations - Special issue: Grid computing
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Scheduling orders for multiple product types to minimize total weighted completion time
Discrete Applied Mathematics
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios
Transportation Science
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Dimensioning and on-line scheduling in Lambda Grids using divisible load concepts
The Journal of Supercomputing
Computers and Operations Research
ACM Transactions on Algorithms (TALG)
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Computation of approximate α-points for large scale single machine scheduling problem
Computers and Operations Research
Proceedings of the 2007 Summer Computer Simulation Conference
Scheduling with Precedence Constraints of Low Fractional Dimension
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Stochastic Online Scheduling Revisited
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Computers and Operations Research
Scheduling hybrid flowshop with parallel batching machines and compatibilities
Computers and Operations Research
Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
Computers and Operations Research
On-line scheduling of parallel machines to minimize total completion times
Computers and Operations Research
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Online scheduling to minimize modified total tardiness with an availability constraint
Theoretical Computer Science
On the approximability of average completion time scheduling under precedence constraints
Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Information Processing Letters
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Resource Allocation Policies for Personalization in Content Delivery Sites
Information Systems Research
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Mathematics of Operations Research
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computers and Operations Research
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
An approximation algorithm for the minimum latency set cover problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximating precedence-constrained single machine scheduling by coloring
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Combinatorial algorithms for data migration to minimize average completion time
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
A simpler proof of preemptive total flow time approximation on parallel machines
Efficient Approximation and Online Algorithms
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters
A 2-approximation algorithm for the network substitution problem
Operations Research Letters
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
Operations Research Letters
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
On-line scheduling to minimize average completion time revisited
Operations Research Letters
Vertex cover in graphs with locally few colors
Information and Computation
Single machine scheduling with scenarios
Theoretical Computer Science
Corrigendum: Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Future Generation Computer Systems
Computers and Operations Research
| Hi-index | 0.01 |