Abstract
We consider the problem of finding a permutation of jobs that minimizes \(\sum _{j}w_jf(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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chrobak, M., Kenyon-Mathieu, C.: SIGACT news online algorithms column 10: competitiveness via doubling. SIGACT News 37(4), 115–126 (2006)
Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M., Stougie, L.: Universal sequencing on a single unreliable machine. SIAM J. Comput. 41(3), 565–586 (2012)
Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22, 513–544 (1997)
Höhn, W., Jacobs, T.: On the performance of Smith’s rule in single-machine scheduling with nonlinear cost. ACM Trans. Algorithms 11(4) 25 (2015)
Megow, N., Mestre, J.: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), pp. 495–504 (2013)
Megow, N., Mestre, J.: On the tradeoff between robustness and approximation. Manuscript (2015)
Megow, N., Verschae, J.: Dual techniques for scheduling on a machine with varying speed. In: Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Lecture Notes in Computer Science, vol. 7965, pp. 745–756. Springer (2013)
Rothkopf, M.H.: Scheduling independent tasks on parallel processors. Manag. Sci. 12, 437–447 (1966)
Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59–66 (1956)
Stiller, S., Wiese, A.: Increasing speed scheduling and flow scheduling. In: Proceedings of the 21st Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science, vol. 6507, pp. 279–290. Springer (2010)
Yuan, J.: The NP-hardness of the single machine common due date weighted tardiness problem. Syst. Sci. Math. Sci. 5(4), 328–333 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Megow, N. (2015). Robustness and Approximation for Universal Sequencing. In: Schulz, A., Skutella, M., Stiller, S., Wagner, D. (eds) Gems of Combinatorial Optimization and Graph Algorithms . Springer, Cham. https://doi.org/10.1007/978-3-319-24971-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-24971-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24970-4
Online ISBN: 978-3-319-24971-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)