Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Approximation in preemptive stochastic online scheduling
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Proceedings of the 2007 Summer Computer Simulation Conference
Stochastic Online Scheduling Revisited
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On-line scheduling of parallel machines to minimize total completion times
Computers and Operations Research
Online scheduling on m uniform machines to minimize total (weighted) completion time
Theoretical Computer Science
Online scheduling to minimize modified total tardiness with an availability constraint
Theoretical Computer Science
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
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
A class of on-line scheduling algorithms to minimize total completion time
Operations Research Letters
On-line scheduling to minimize average completion time revisited
Operations Research Letters
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Single machine batch scheduling with release times and delivery costs
Journal of Scheduling
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
Hi-index | 0.00 |
We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem based on solving a preemptive or linear programming relaxation and then using the solution to get an ordering on the jobs. We introduce several new techniques which generalize this basic paradigm. We use these ideas to obtain improved approximation algorithms for one-machine scheduling to minimize average completion time with release dates. In the process, we obtain an optimal randomized on-line algorithm for the same problem that beats a lower bound for deterministic on-line algorithms. We consider extensions to the case of parallel machine scheduling, and for this we introduce two new ideas: first, we show that a preemptive one-machine relaxation is a powerful tool for designing parallel machine scheduling algorithms that simultaneously produce good approximations and have small running times; second, we show that a nongreedy "rounding" of the relaxation yields better approximations than a greedy one. We also prove a general theorem relating the value of one-machine relaxations to that of the schedules obtained for the original m-machine problems. This theorem applies even when there are precedence constraints on the jobs. We apply this result to obtain improved approximation ratios for precedence graphs such as in-trees, out-trees, and series-parallel graphs.