Approximation algorithms for general parallel task scheduling

DOI10.1016/S0020-0190(01)00210-1zbMath1032.68027MaRDI QIDQ1603514

Oh-Heum Kwon, Kyung-Yong Chwa

Publication date: 14 July 2002

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

zbMATH Keywords

AlgorithmsApproximation algorithmsParallel task scheduling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• An approximation algorithm for scheduling on three dedicated machines
• Improved non-approximability results
• A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
• Simultaneous Resource Scheduling to Minimize Weighted Flow Times
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• On the hardness of approximating minimization problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for general parallel task scheduling