Approximation algorithms for maximum weighted throughput on unrelated machines

DOI10.4230/LIPICS.APPROX/RANDOM.2023.5MaRDI QIDQ6663014FDOQ6663014

Authors: George Karakostas, Stavros G. Kolliopoulos 

Publication date: 14 January 2025

Recommendations

• Approximating the throughput of multiple machines in real-time scheduling
• Approximability of average completion time scheduling on unrelated machines
• Breaking \(1-1/e\) barrier for non-preemptive throughput maximization
• A PTAS for the average weighted completion time problem on unrelated machines.

zbMATH Keywords

approximation algorithmschedulingPTASunrelated machinesmaximum weighted throughput

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: Approximation algorithms for maximum weighted throughput on unrelated machines

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