The preemptive resource allocation problem
From MaRDI portal
Publication:6547132
DOI10.1007/S10951-023-00786-6zbMATH Open1542.90116MaRDI QIDQ6547132
Hadas Shachnai, Baruch Schieber, Kanthi K. Sarpatwar
Publication date: 30 May 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Scheduling web advertisements: a note on the minspace problem
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Performance bounds of algorithms for scheduling advertisements on a web page
- Scheduling space-sharing for internet advertising
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Approximating the advertisement placement problem
- Eliminating migration in multi-processor scheduling
- Approximating the throughput of multiple machines in real-time scheduling
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- Improved Algorithms for Resource Allocation under Varying Capacity
- An improved approximation algorithm for resource allocation
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Resource Minimization Job Scheduling
- Improved Approximation for Vector Bin Packing
- On Multidimensional Packing Problems
- A logarithmic approximation for unsplittable flow on line graphs
- Weighted Flowtime on Capacitated Machines
- A unified approach to approximating resource allocation and scheduling
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)
