A robust maximum completion time measure for scheduling

DOI10.1145/1109557.1109594zbMath1192.90067OpenAlexW4252287629MaRDI QIDQ3581492

Samir Khuller, Moses Charikar

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109594

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (5)

New approximation results for resource replication problems ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Minimizing average flow-time under knapsack constraint ⋮ A model for minimizing active processor time ⋮ Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems

This page was built for publication: A robust maximum completion time measure for scheduling