Cutting-plane algorithms for preemptive uniprocessor scheduling problems

DOI10.1007/s11241-023-09408-yMaRDI QIDQ6554176

Abhishek Singh

Publication date: 12 June 2024

Published in: Real-Time Systems (Search for Journal in Brave)

zbMATH Keywords

fixed-point iterationcutting planesfixed priorityearliest deadline firstlinear programming dualityhard real-time scheduling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Real time scheduling theory: A historical perspective
• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions

This page was built for publication: Cutting-plane algorithms for preemptive uniprocessor scheduling problems