An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line approximation algorithms
Mathematics of Operations Research
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
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth 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
Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling
Proceedings of the tenth 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
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Convex Quadratic Programming Relaxations for Network Scheduling Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Semidefinite Relaxations for Parallel Machine Scheduling
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lower Bounds for On-Line Single-Machine Scheduling
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
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,
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Implementation of a PTAS for Scheduling with Release Dates
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
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
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
Note: minimizing makespan with release times on identical parallel batching machines
Discrete Applied Mathematics
Theoretical Computer Science
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
Scheduling orders for multiple product types to minimize total weighted completion time
Discrete Applied Mathematics
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
ACM Transactions on Algorithms (TALG)
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
A Global Constraint for Total Weighted Completion Time
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Stochastic Online Scheduling Revisited
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximability of Average Completion Time Scheduling on Unrelated Machines
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Scheduling hybrid flowshop with parallel batching machines and compatibilities
Computers and Operations Research
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
Theoretical Computer Science
Online Scheduling with Bounded Migration
Mathematics of Operations Research
Scheduling with Rejection to Minimize the Makespan
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
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
Note: Minimizing makespan with release times on identical parallel batching machines
Discrete Applied Mathematics
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Scheduling an unbounded batch machine to minimize maximum lateness
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Parallel-machine scheduling with deteriorating jobs and rejection
Theoretical Computer Science
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Computers and Operations Research
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
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
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the performance of smith's rule in single-machine scheduling with nonlinear cost
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
Competitive analysis of preemptive single-machine scheduling
Operations Research Letters
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
A class of on-line scheduling algorithms to minimize total completion time
Operations Research Letters
Minimizing makespan on a single batching machine with release times and non-identical job sizes
Operations Research Letters
Operations Research Letters
On-line scheduling to minimize average completion time revisited
Operations Research Letters
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
A framework for scheduling with online availability
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Single machine batch scheduling with release times and delivery costs
Journal of Scheduling
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Dual techniques for scheduling on a machine with varying speed
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Theoretical Computer Science
| Hi-index | 0.01 |
We consider the problem of scheduling n jobs with release dates on m machines so as to minimize their average weighted completion time. We present the first known polynomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unrelated machines with and without preemption allowed. Our schemes are efficient: for all variants the running time for a \math approximation is of the form \math poly(n).