In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the job completion times. For a variety of scheduling models, these techniques yield the first algorithms that are guaranteed to find schedules that have objective function value within a constant factor of the optimum. In the first approach, we use an optimal solution to a linear programming relaxation in order to guide a simple list-scheduling rule. Consequently, we also obtain results about the strength of the relaxation. Our second approach yields on-line algorithms for these problems: in this setting, we are scheduling jobs that continually arrive to be processed and, for each time t, we must construct the schedule until time t without any knowledge of the jobs that will arrive afterwards. Our on-line technique yields constant performance guarantees for a variety of scheduling environments, and in some cases essentially matches the performance of our off-line LP-based algorithms. 1
|
239
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
165
|
Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms
– Hall, Schulz, et al.
- 1997
|
|
140
|
Fast approximation algorithms for the knapsack and sum of subset problems
– Ibarra, Kim
- 1975
|
|
138
|
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
– Hochbaum, Shmoys
- 1987
|
|
122
|
Scheduling parallel machines online
– Shmoys, Wein, et al.
- 1995
|
|
109
|
Complexity of machine scheduling problems
– Lenstra, Kan, et al.
- 1977
|
|
102
|
An approximation algorithm for the generalized assignment problem
– Shmoys, Tardos
- 1993
|
|
99
|
Various Optimizers for Single-Stage Production
– Smith
- 1956
|
|
85
|
Divide-and-Conquer Approximation Algorithms via Spreading Metrics
– Even, Naor, et al.
|
|
71
|
The minimum latency problem
– Blum, Chalasani, et al.
- 1994
|
|
69
|
Scheduling independent tasks to reduce mean finishing time
– Coffman, Sethi
- 1974
|
|
67
|
Improved scheduling algorithms for minsum criteria
– Chakrabarti, Phillips, et al.
- 1996
|
|
47
|
ffl-approximations with minimum packing constraint violation
– Lin, Vitter
- 1992
|
|
45
|
Formulating the single machine sequencing problem with release dates as mixed integer program
– Dyer, Wolsey
- 1990
|
|
43
|
Scheduling jobs that arrive over time
– Phillips, Stein, et al.
- 1995
|
|
40
|
Structure of a Simple Scheduling Polyhedron
– Queyranne
- 1993
|
|
38
|
Competitive Distributed Job Scheduling
– Awerbuch, Kutten, et al.
- 1992
|
|
38
|
Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-based Heuristics and Lower Bounds
– Schulz
- 1996
|
|
36
|
Polyhedral approaches to machine scheduling
– Queyranne, Schulz
- 1994
|
|
31
|
Worst case bound of an LRF schedule for the mean weighted flow-time problem
– Kawaguchi, Kyan
- 1986
|
|
28
|
A supermodular relaxation for scheduling with release dates
– Goemans
- 1996
|
|
24
|
On the facial structure of scheduling polyhedra
– Balas
- 1985
|
|
24
|
Task Scheduling in Networks
– Phillips, Stein, et al.
- 1994
|
|
24
|
Single-machine scheduling polyhedra with precedence constraints
– Queyranne, Wang
- 1991
|
|
24
|
A time indexed formulation of non-preemptive single machine scheduling problems, Math Program 54
– Sousa, Wolsey
- 1992
|
|
21
|
Ordering problems approximated: single-processor scheduling and interval graph completion
– Ravi, Agrawal, et al.
- 1991
|
|
18
|
Deterministic load balancing in computer networks
– Deng, Liu, et al.
- 1990
|
|
18
|
Efficient scheduling of tasks without full use of processor resources
– Jaffe
- 1980
|
|
17
|
An algorithm for the single machine sequencing problem with precedence constraints
– Potts
- 1980
|
|
14
|
A heuristic for a scheduling problem with communication delays
– Munier, Konig
- 1997
|
|
12
|
A time-indexed formulation for single-machine scheduling problems: branch and cut
– Akker, Hurkens, et al.
- 1995
|
|
11
|
Rinnooy Kan
– Lawler, Lenstra, et al.
- 1980
|
|
11
|
Scheduling jobs with communication delays: using infeasible solutions for approximation
– Mohring, Schaffter, et al.
- 1996
|
|
11
|
Mixed Integer Programming Formulations for Production Planning and Scheduling Problems. Invited talk at the
– Wolsey
- 1985
|
|
9
|
Scheduling jobs of equal length: complexity, facets and computational results
– Crama, Spieksma
- 1995
|
|
8
|
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
– Queyranne, Schulz
- 1995
|
|
8
|
A cutting plane procedure for precedence-constrained single machine scheduling. Working paper
– Queyranne, Wang
- 1991
|
|
7
|
Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling
– Lasserre, Queyranne
- 1992
|
|
7
|
Approximation algorithms for scheduling unrelated parallel machines
– Tardos
- 1990
|
|
6
|
Facets of the generalized permutahedron of a poset
– Arnim, Schulz
- 1994
|
|
6
|
Scheduling and Polytopes
– Schulz
- 1996
|
|
5
|
The permutahedron of N-sparse posets
– Arnim, Schrader, et al.
- 1996
|
|
5
|
Facet inducing inequalities for single-machine scheduling problems, Memorandum COSOR
– Akker, Hoesel, et al.
- 1993
|
|
3
|
Job scheduling for practical parallel database and scientific applications
– Chakrabarti, Muthukrishnan
- 1996
|
|
3
|
LP-based solution methods for single-machine scheduling problems
– Akker
- 1994
|
|
2
|
Near-optimal schedules for precedence-constrained scheduling problems on uniformly related parallel machines
– Chudak, Shmoys
- 1996
|
|
2
|
Earliest completion time and shortest remaining processing time sequencing rules
– Lai
- 1995
|
|
2
|
Scheduling multiple variable speed machines
– Trick
- 1994
|
|
