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

DOI10.1016/S0005-1098(03)00028-1MaRDI QIDQ1810562zbMATH OpenOpenAlexFDO

Authors Carlos C. Amaro, Sanjoy K. Baruah, 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

allocationload balancingmultiple processorsnon-preemptive schedulingreal-time systemsresource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1529456
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• Task Scheduling in Networks

Cites work

• Fast algorithms for bin packing
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1529456 (Why is no real title available?)
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• New strategies for assigning real-time tasks to multiprocessor systems

Cited in

(5)

• Non-preemptive scheduling with setup times: a PTAS
• Non-clairvoyant scheduling for minimizing mean slowdown
• On non-preemptive scheduling of recurring tasks using inserted idle times
• Scheduling non-preemptible jobs to minimize peak demand
• scientific article; zbMATH DE number 1529456 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810562)