Assigning sporadic tasks to unrelated machines

DOI10.1007/S10107-014-0786-9zbMath1334.68101OpenAlexW2080620189MaRDI QIDQ494326

Alberto Marchetti-Spaccamela, Cyriel Rutten, Andreas Wiese, Suzanne Van der Ster

Publication date: 31 August 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01249101/file/marchettispaccamela2014.pdf

zbMATH Keywords

schedulinginteger linear programmingunrelated machinesroundingdemand bound functionsporadic task systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (1)

Algorithms for hierarchical and semi-partitioned parallel scheduling

Cites Work

• Open problems in real-time scheduling
• Improved multiprocessor global schedulability analysis
• A constant-approximate feasibility test for multiprocessor real-time scheduling
• The Santa Claus problem
• Convex programming for scheduling unrelated parallel machines

This page was built for publication: Assigning sporadic tasks to unrelated machines