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
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third 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
Approximation Techniques for Average Completion Time Scheduling
SIAM Journal on Computing
Single Machine Scheduling with Release Dates
SIAM Journal on Discrete Mathematics
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Online scheduling in a parallel batch processing system to minimize makespan using restarts
Theoretical Computer Science
Online single machine batch scheduling
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
| Hi-index | 5.23 |
The problem of scheduling jobs that arrive over time on a single machine is well studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.