A robust maximum completion time measure for scheduling

DOI10.1145/1109557.1109594MaRDI QIDQ3581492zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(4)

• Rejecting jobs to minimize load and maximum flow-time
• New approximation results for resource replication problems
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• Minimizing average flow-time under knapsack constraint

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

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