On the worst-case ratio of a compound multiprocessor scheduling algorithm

DOI10.1016/0020-0190(87)90217-1zbMath0634.68024OpenAlexW2079915495MaRDI QIDQ1097028

Manfred Kunde, Horst Steppat

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90217-1

zbMATH Keywords

Approximation algorithmsbin packingworst-case ratioprocessor scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

On the Complexity of Scheduling to Optimize Average Response Time

Cites Work

• Unnamed Item
• Unnamed Item
• NP-complete scheduling problems
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: On the worst-case ratio of a compound multiprocessor scheduling algorithm