A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines

DOI10.1007/s10951-012-0293-xzbMath1297.90056OpenAlexW2048209559MaRDI QIDQ398864

Dimitrios G. Pandelis

Publication date: 18 August 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-012-0293-x

zbMATH Keywords

dynamic programmingwireless communicationsgeometric processing timesscheduling with deadlines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems

Cites Work

• Unnamed Item
• Scheduling real-time traffic with deadlines over a wireless channel
• Optimal multiplexing on a single link: delay and buffer requirements

This page was built for publication: A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines