Minimizing Average Flow Time on Unrelated Machines

DOI10.1007/978-3-540-93980-1_6zbMath1209.68653OpenAlexW1559868135MaRDI QIDQ3602830

R. A. Sitters

Publication date: 12 February 2009

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_6

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations

Cites Work

• Unnamed Item
• The complexity of mean flow time scheduling problems with release times
• Minimizing flow time on a constant number of machines with preemption
• Approximating total flow time on parallel machines
• Minimizing the flow time without migration
• Minimizing average flow time on related machines
• Approximability of Average Completion Time Scheduling on Unrelated Machines
• Minimizing Total Flow-Time: The Unrelated Case
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Complexity of preemptive minsum scheduling on unrelated parallel machines

This page was built for publication: Minimizing Average Flow Time on Unrelated Machines