Minimizing maximum (weighted) flow-time on related and unrelated machines

DOI10.1007/s00453-015-0082-yzbMath1358.90040OpenAlexW2190420042MaRDI QIDQ513278

Yong-Cai Geng, Sumit K. Garg

Publication date: 3 March 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0082-y

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsminimizing flow-time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
• Meeting Deadlines: How Much Speed Suffices?
• On-Line Load Balancing of Temporary Tasks
• All-Norms and All-L_p-Norms Approximation Algorithms
• Server scheduling in the L _p norm
• The Competitiveness of On-Line Assignments
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• LATIN 2004: Theoretical Informatics
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Minimizing maximum (weighted) flow-time on related and unrelated machines