Robustness and Approximation for Universal Sequencing

Nicole Megow ()
Additional contact information
Nicole Megow: Technische Universität München, Fakultät für Mathematik

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 133-141 from Springer

Abstract: Abstract We consider the problem of finding a permutation of jobs that minimizes $$\sum _{j}w_jf(C_j)$$ ∑ j w j f ( C j ) on a single machine for some non-negative, non-decreasing global cost function f. We are interested in universal solutions that perform well for all functions f simultaneously. We construct universal sequences that are within a factor of 4 of the optimal cost for any f. Furthermore, we analyze the tradeoff between the robustness for all cost functions and the approximation of the well understood case of linear cost functions.

Date: 2015
References: Add references at CitEc
Citations:

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-3-319-24971-1_13

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

DOI: 10.1007/978-3-319-24971-1_13

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 ().