Worst case bound of an LRF schedule for the mean weighted flow-time problem
SIAM Journal on Computing
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Tighter bounds on a heuristic for a partition problem
Information Processing Letters
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh 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
Scheduling parallel tasks to minimize average response time
SODA '94 Proceedings of the fifth 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
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Optimal scheduling of multiclass parallel machines
Proceedings of the tenth 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
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
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
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We review approximability and inapproximability results for MIN-SUM scheduling problems and we focus on two main techniques for designing polynomial time approximation schemes for this class of problems: ratio partitioning and time partitioning. For both techniques we present examples which illustrate their efficient use.