The triangle scheduling problem

DOI10.1007/s10951-017-0533-1zbMath1406.90040arXiv1602.04365OpenAlexW2296673948MaRDI QIDQ1617282

Gerhard J. Woeginger, Christoph Dürr, Yasmina Seddik, Zdeněk Hanzálek, Christian Konrad, Oscar C. Vásquez, R. A. Sitters

Publication date: 7 November 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.04365

zbMATH Keywords

schedulingpackingmixed-criticality

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem
• A robust approach for the single machine scheduling problem
• Scheduling Real-Time Mixed-Criticality Jobs

This page was built for publication: The triangle scheduling problem