Scheduling Periodic Tasks

DOI10.1287/ijoc.8.4.428zbMath0884.90103OpenAlexW1973446402MaRDI QIDQ4367057

Jan H. M. Korst, Jan Karel Lenstra, Emile H. L. Aarts

Publication date: 25 November 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.8.4.428

zbMATH Keywords

approximation algorithmNP-completeminimum number of processorsnonpreemptively scheduling periodic tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Strictly periodic scheduling in IMA-based architectures ⋮ Efficient scheduling of periodic information monitoring requests

This page was built for publication: Scheduling Periodic Tasks