Abstract
We discuss a number of polynomial time approximation results for scheduling problems. All presented results are based on the technique of rounding the optimal solution of an underlying linear programming relaxation. We analyse these relaxations, their integrality gaps, and the resulting approximation algorithms, and we derive matching worst-case instances.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chekuri, C. and Motwani, R. (1999). Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics, 98:29–38.
Chekuri, C., Motwani, R., Natarajan, B. and Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31:146–166.
Chudak, F. and Hochbaum, D. S. (1999). A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters, 25:199–204.
Dyer, M. E. and Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26:255–270.
Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability. Freeman, New York.
Gonzalez, T. and Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of the ACM, 23:665–679.
Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563–1581.
Graham, R. L. (1969). Bounds on multiprocessor timing anomalies. SIAM Journal on Applied Mathematics, 17:416–429.
Graham, R. L., Lawler, E. L., Lenstra, J. K. and Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287–326.
Hall, L. A., Schulz, A. S., Shmoys, D. B. and Wein, J. (1997). Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513–544.
Hochbaum, D. S. and Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34:144–162.
Hoogeveen, J. A., Lenstra, J. K. and Veltman, B. (1994). Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters, 16:129–137.
Hoogeveen, H., Skutella, M. and Woeginger, G. J. (2003). Preemptive scheduling with rejection. Mathematical Programming, 94:361–374.
Kellerer, H., Tautenhahn, T. and Woeginger, G. J. (1996). Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC'96), pp. 418–426.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin (Eds.), North-Holland, Amsterdam, pp. 445–522.
Lenstra, J. K., Shmoys, D. B. and Tardos, É. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259–271.
Munier, A. and König, J. C. (1997). A heuristic for a scheduling problem with communication delays. Operations Research, 45:145–147.
Papadimitriou, C. H. and Yannakakis, M. (1990). Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19:322–328.
Picouleau, C. (1992). Etude des problèmes d'optimisation dans les systèmes distribués. Thèse, l'Université Paris 6.
Potts, C. N. (1980). An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study, 13:78–87.
Torng, E. and Uthaisombut, P. (1999). A tight lower bound for the best-alpha algorithm. Information Processing Letters, 71:17–22.
Veltman, B., Lageweg, B. J. and Lenstra. J. K. (1990). Multiprocessor scheduling with communication delays. Parallel Computing, 16:173–182.
Williamson, D. P., Hall, L. A., Hoogeveen, J. A., Hurkens, C. A. J., Lenstra, J. K., Sevastianov, S. V. and Shmoys, D. B. (1997). Short shop schedules. Operations Research, 45:288–294.
Woeginger, G. J. (2000). A comment on scheduling on uniform machines under chain-type precedence constraints. Operations Research Letters, 26:107–109.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this paper
Cite this paper
Woeginger, G.J. (2005). Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds) Multidisciplinary Scheduling: Theory and Applications. Springer, Boston, MA. https://doi.org/10.1007/0-387-27744-7_2
Download citation
DOI: https://doi.org/10.1007/0-387-27744-7_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25266-7
Online ISBN: 978-0-387-27744-8
eBook Packages: Business and EconomicsBusiness and Management (R0)