The preemptive resource allocation problem

DOI10.1007/S10951-023-00786-6MaRDI QIDQ6547132zbMATH OpenFDO

Authors Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Publication date 30 May 2024

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10951-023-00786-6

zbMATH Keywords

approximation algorithmsmachine schedulingresource allocationvector packing

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
• Flexible resource allocation to interval jobs
• Real-time \(k\)-bounded preemptive scheduling
• scientific article; zbMATH DE number 1670665
• Resource Minimization Job Scheduling

Cites work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• A logarithmic approximation for unsplittable flow on line graphs
• A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
• A unified approach to approximating resource allocation and scheduling
• An improved approximation algorithm for \textsc{Resource Allocation}
• Approximating the advertisement placement problem
• Approximating the throughput of multiple machines in real-time scheduling
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Eliminating migration in multi-processor scheduling
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 2086932 (Why is no real title available?)
• scientific article; zbMATH DE number 1445390 (Why is no real title available?)
• Improved algorithms for resource allocation under varying capacity
• Improved Approximation for Vector Bin Packing
• On Multidimensional Packing Problems
• Performance bounds of algorithms for scheduling advertisements on a web page
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Resource Minimization Job Scheduling
• Scheduling space-sharing for internet advertising
• Scheduling web advertisements: a note on the minspace problem
• Tight approximation algorithms for maximum separable assignment problems
• Weighted flowtime on capacitated machines

This page was built for publication: The preemptive resource allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547132)