On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

DOI10.1016/j.orl.2004.10.006zbMath1082.90032OpenAlexW1981135899MaRDI QIDQ813965

Christoph Ambühl, Monaldo Mastrolilli

Publication date: 2 February 2006

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.10.006

zbMATH Keywords

schedulingon-line algorithmspreemptionMax flow time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Related Items

On-line service scheduling ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Unnamed Item ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines

Cites Work

• An optimal algorithm for preemptive on-line scheduling
• Minimizing the flow time without migration
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item