Real-time scheduling with a budget

DOI10.1007/s00453-006-0191-8zbMath1111.68015OpenAlexW2020804547MaRDI QIDQ878439

Tami Tamir, Hadas Shachnai, Joseph (Seffi) Naor

Publication date: 26 April 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0191-8

zbMATH Keywords

job interval selection problemreal-time scheduling with overlaps

Mathematics Subject Classification ID

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

Related Items (6)

Single machine scheduling with two competing agents and equal job processing times ⋮ Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle ⋮ Budgeted matching and budgeted matroid intersection via the gasoline puzzle ⋮ On Lagrangian Relaxation and Subset Selection Problems

This page was built for publication: Real-time scheduling with a budget