Minimizing Average Flow Time on Unrelated Machines

DOI10.1007/978-3-540-93980-1_6MaRDI QIDQ3602830zbMATH OpenOpenAlexFDO

Authors René 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)

Recommendations

• Minimizing average flow time on related machines
• Minimizing flow-time on unrelated machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Minimizing Total Flow-Time: The Unrelated Case
• Minimizing Average Flow-Time

Cites work

• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• Approximability of Average Completion Time Scheduling on Unrelated Machines
• Approximating total flow time on parallel machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Minimizing Total Flow-Time: The Unrelated Case
• Minimizing average flow time on related machines
• Minimizing flow time on a constant number of machines with preemption
• Minimizing the flow time without migration
• The complexity of mean flow time scheduling problems with release times

Cited in

(13)

• Minimizing Average Flow-Time
• Minimizing flow-time on unrelated machines
• scientific article; zbMATH DE number 6469165 (Why is no real title available?)
• Minimizing average flow time on related machines
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
• Minimizing average flow-time under knapsack constraint
• Minimizing average flow-time under knapsack constraint
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Minimizing Maximum Flow-time on Related Machines
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Minimizing Total Flow-Time: The Unrelated Case
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems

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

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