Minimizing Maximum Flow-time on Related Machines

DOI10.4230/LIPICS.APPROX-RANDOM.2015.85zbMATH Open1375.90116OpenAlexW2296769330MaRDI QIDQ5351891

Bouke Cloostermans, Nikhil Bansal

Publication date: 31 August 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/approx/approx2015.html#BansalC15

zbMATH Keywords

approximation algorithmonline algorithmmaximum flow-time minimizationrelated machines scheduling

Mathematics Subject Classification ID

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

Related Items (3)

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines ⋮ Title not available (Why is that?) ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimizing maximum (weighted) flow-time on related and unrelated machines 👍 👎
• Minimizing flow time on a constant number of machines with preemption 👍 👎
• Minimizing maximum flow-time on related machines 👍 👎
• Minimizing average flow time on related machines 👍 👎
• Minimizing Flow-Time on Unrelated Machines 👍 👎
• Minimizing Average Flow Time on Unrelated Machines 👍 👎
• Better Algorithms for Minimizing Average Flow-Time on Related Machines 👍 👎
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines 👍 👎

This page was built for publication: Minimizing Maximum Flow-time on Related Machines

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