Real-time scheduling with a budget
From MaRDI portal
Publication:878439
DOI10.1007/S00453-006-0191-8zbMATH Open1111.68015OpenAlexW2020804547MaRDI QIDQ878439FDOQ878439
Authors: Hadas Shachnai, Tami Tamir, 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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cited In (10)
- Title not available (Why is that?)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Single machine scheduling with two competing agents and equal job processing times
- Real time scheduling with a budget: parametric-search is better than binary search
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- On Lagrangian Relaxation and Subset Selection Problems
- Towards Budgeting in Real-Time Calculus: Deferrable Servers
- Title not available (Why is that?)
- On Lagrangian relaxation for constrained maximization and reoptimization problems
This page was built for publication: Real-time scheduling with a budget
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878439)