A unified approach to approximating resource allocation and scheduling

DOI10.1145/335305.335410zbMath1296.68023OpenAlexW2049033541MaRDI QIDQ5895207

Baruch Schieber, Ari Freund, Amotz Bar-Noy, Joseph (Seffi) Naor, Reuven Bar Yehuda

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335410

zbMATH Keywords

resource allocationinterval graphsbandwidth allocationinterval schedulingscheduling with release times and deadlines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (15)

Approximation algorithms for NMR spectral peak assignment. ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ Online real-time preemptive scheduling of jobs with deadlines on multiple machines ⋮ Real-time scheduling to minimize machine busy times ⋮ Unnamed Item ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ Bicriteria scheduling for contiguous and non contiguous parallel tasks ⋮ Flexible resource allocation to interval jobs ⋮ Caching is hard -- even in the fault model ⋮ Shape rectangularization problems in intensity-modulated radiation therapy ⋮ On Lagrangian Relaxation and Subset Selection Problems ⋮ New results on web caching with request reordering ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Efficient job scheduling algorithms with multi-type contentions ⋮ Primal-dual approximation algorithms for a packing-covering pair of problems

This page was built for publication: A unified approach to approximating resource allocation and scheduling