Non-preemptive scheduling to maximize the minimum global inter-completion time

DOI10.1016/S0005-1098(03)00028-1zbMath1013.90059OpenAlexW1989642324MaRDI QIDQ1810562

Sanjoy K. Baruah, Carlos C. Amaro, Wolfgang A. Halang, Alexander D. Stoyenko

Publication date: 9 June 2003

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(03)00028-1

zbMATH Keywords

real-time systemsload balancingallocationresourcenon-preemptive schedulingmultiple processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Fast algorithms for bin packing
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• New strategies for assigning real-time tasks to multiprocessor systems

This page was built for publication: Non-preemptive scheduling to maximize the minimum global inter-completion time