Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- Andreas S. Schulz
- … show all 1 hide
There has been recent success in using polyhedral formulations of scheduling problems not only to obtain good lower bounds in practice but also to develop provably good approximation algorithms. Most of these formulations rely on binary decision variables that are a kind of assignment variables. We present quite simple polynomialtime approximation algorithms that are based on linear programming formulations with completion time variables and give the best known performance guarantees for minimizing the total weighted completion time in several scheduling environments. This amplifies the importance of (appropriate) polyhedral formulations in the design of approximation algorithms with good worst-case performance guarantees.
In particular, for the problem of minimizing the total weighted completion time on a single machine subject to precedence constraints we present a polynomial-time approximation algorithm with performance ratio better than 2. This outperforms a (4 + ε)-approximation algorithm very recently proposed by Hall, Shmoys, and Wein that is based on time-indexed formulations. A slightly extended formulation leads to a performance guarantee of 3 for the same problem but with release dates. This improves a factor of 5.83 for the same problem and even the 4-approximation algorithm for the problem with release dates but without precedence constraints, both also due to Hall, Shmoys, and Wein.
By introducing new linear inequalities, we also show how to extend our technique to parallel machine problems. This leads, for instance, to the best known approximation algorithm for scheduling jobs with release dates on identical parallel machines. Finally, for the flow shop problem to minimize the total weighted completion time with both precedence constraints and release dates we present the first approximation algorithm that achieves a worst-case performance guarantee that is linear in the number of machines. We even extend this to multiprocessor flow shop scheduling.
The proofs of these results also imply guarantees for the lower bounds obtained by solving the proposed linear programming relaxations. This emphasizes the strength of linear programming formulations using completion time variables.
- Bruno, J. L., Coffman, E. G., Sethi, R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the Association for Computing Machinery 17: pp. 382-387
- S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for minsum criteria, 1996. To appear in Springer Lecture Notes in Computer Science, Proceedings of the 23rd ICALP Conference.
- Dyer, M. E., Wolsey, L. A. (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 26: pp. 255-270 CrossRef
- Garey, M. R., Johnson, D. S., Sethi, R. (1976) The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1: pp. 117-129
- Graham, R. L., Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R. (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: pp. 287-326
- Grötschel, M., Lovász, L., Schrijver, A. (1988) Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin
- M. X. Goemans. A supermodular relaxation for scheduling with release dates. This volume, 1996.
- Gonzalez, T., Sahni, S. (1978) Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26: pp. 36-52
- J. A. Hoogeveen, C. Hurkens, J. K. Lenstra, and A. Vandevelde. Lower bounds for the multiprocessor flow shop. In preparation.
- Hochbaum, D. S., Shmoys, D. B. (1988) A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing 17: pp. 539-551 CrossRef
- L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms, 1996. In preparation.
- L. A. Hall, D. B. Shmoys, and J. Wein. Personal communication, September 1995.
- L. A. Hall, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pages 142–151, January 1996.
- Kawaguchi, T., Kyan, S. (1986) Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing 15: pp. 1119-1129 CrossRef
- Lawler, E. L. (1978) Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Mathematics 2: pp. 75-90
- Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., Shmoys, D. B. Sequencing and scheduling: Algorithms and complexity. In: Graves, S. C., Kan, A. H. G. R., Zipkin, P. H. eds. (1993) Logistics of Production and Inventory, volume 4 of Handbooks in Operations Research and Management Science. North-Holland, Amsterdam, The Netherlands, pp. 445-522
- Lenstra, J. K., Kan, A. H. G. R., Brucker, P. (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: pp. 343-362
- Lenstra, J. K., Shmoys, D. B., Tardos, É. (1990) Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46: pp. 259-271 CrossRef
- Möhring, R. H., Schäffter, M. W., Schulz, A. S. (1996) Scheduling with communication delays: Minimizing the average weighted completion time. Department of Mathematics, Technical University of Berlin, Berlin, Germany
- Phillips, C., Stein, C., Wein, J. (1995) Scheduling jobs that arrive over time. Springer, Berlin
- Queyranne, M., Schulz, A. S. (1994) Polyhedral approaches to machine scheduling. Department of Mathematics, Technical University of Berlin, Berlin, Germany
- Queyranne, M., Schulz, A. S. Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds. In: Balas, E., Clausen, J. eds. (1995) Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science. Springer, Berlin, pp. 307-320
- Queyranne, M. (1993) Structure of a simple scheduling polyhedron. Mathematical Programming 58: pp. 263-285 CrossRef
- M. Queyranne. Personal communication, September 1995.
- M. Queyranne and Y. Wang. A cutting plane procedure for precedence-constrained single machine scheduling. Working paper. Faculty of Commerce, University of British Columbia, Vancouver, Canada, 1991.
- Rajendran, C., Chaudhuri, D. (1992) A multi-stage parallel-processor flowshop problem with minimum flowtime. European Journal of Operational Research 57: pp. 111-122 CrossRef
- Schulz, A. S. (1995) Polytopes and Scheduling. PhD thesis. Technical University of Berlin, Berlin, Germany
- Schulz, A. S. (1995) Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds. Department of Mathematics, Technical University of Berlin, Berlin, Germany
- Smith, W. E. (1956) Various optimizers for single-stage production. Naval Research and Logistics Quarterly 3: pp. 59-66
- Shmoys, D. B., Tardos, E. (1993) An approximation algorithm for the generalized assignment problem. Mathematical Programming 62: pp. 461-474 CrossRef
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- Book Title
- Integer Programming and Combinatorial Optimization
- Book Subtitle
- 5th International IPCO Conference Vancouver, British Columbia, Canada, June 3–5, 1996 Proceedings
- pp 301-315
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.