Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling

Gerhard J. Woeginger ()
Additional contact information
Gerhard J. Woeginger: TU Eindhoven

A chapter in Multidisciplinary Scheduling: Theory and Applications, 2005, pp 19-36 from Springer

Abstract: 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: approximation algorithm; worst-case analysis; performance guarantee; linear programming relaxation; integrality gap; scheduling (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-27744-8_2

Ordering information: This item can be ordered from
http://www.springer.com/9780387277448

DOI: 10.1007/0-387-27744-7_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().