Real-time scheduling with a budget

DOI10.1007/S00453-006-0191-8MaRDI QIDQ878439zbMATHOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 2038779
• Real time scheduling with a budget: parametric-search is better than binary search
• scientific article; zbMATH DE number 2119735
• Throughput maximization of real-time scheduling with batching
• Real-time scheduling to minimize machine busy times

Cited in

(12)

• Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
• scientific article; zbMATH DE number 2038779 (Why is no real title available?)
• scientific article; zbMATH DE number 2119735 (Why is no real title available?)
• On Lagrangian relaxation for constrained maximization and reoptimization problems
• Throughput maximization of real-time scheduling with batching
• Single machine scheduling with two competing agents and equal job processing times
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• 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
• On Lagrangian Relaxation and Subset Selection Problems
• Towards Budgeting in Real-Time Calculus: Deferrable Servers
• Real-time \(k\)-bounded preemptive scheduling

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)