Multi-phase algorithms for throughput maximization for real-time scheduling

DOI10.1023/A:1009822211065zbMath0991.90061OpenAlexW1492069605MaRDI QIDQ1587588

Piotr Berman, Bhaskar Das Gupta

Publication date: 23 April 2002

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009822211065

zbMATH Keywords

approximation algorithmsreal-time scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (8)

Improved algorithms for resource allocation under varying capacity ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs ⋮ Conversion of coloring algorithms into maximum weight independent set algorithms ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Consistent sets of secondary structures in proteins ⋮ Aligning two fragmented sequences ⋮ Primal-dual approximation algorithms for a packing-covering pair of problems

This page was built for publication: Multi-phase algorithms for throughput maximization for real-time scheduling