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

DOI10.1016/J.ORL.2004.10.006MaRDI QIDQ813965zbMATH OpenOpenAlexFDO

Authors 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

preemptionschedulingon-line algorithmsMax flow time

Mathematics Subject Classification ID

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

Recommendations

• An optimal algorithm for preemptive on-line scheduling
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• Scheduling to minimize max flow time: offline and online algorithms.
• Online flow time scheduling in the presence of preemption overhead
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• scientific article; zbMATH DE number 7650321
• Preemptive online scheduling: Optimal algorithms for all speeds
• Preemptive Online Scheduling: Optimal Algorithms for All Speeds
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

Cites work

• scientific article; zbMATH DE number 1256760 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 1303566 (Why is no real title available?)
• scientific article; zbMATH DE number 1559527 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• An optimal algorithm for preemptive on-line scheduling
• Minimizing the flow time without migration
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS

Cited in

(19)

• Minimizing maximum flow-time on related machines
• Increasing speed scheduling and flow scheduling
• Online single machine scheduling to minimize the maximum starting time
• scientific article; zbMATH DE number 1670528 (Why is no real title available?)
• scientific article; zbMATH DE number 1839473 (Why is no real title available?)
• A scheduling framework for distributed key-value stores and its application to tail latency minimization
• Scheduling to minimize max flow time: offline and online algorithms.
• Optimal on-line flow time with resource augmentation
• Maximizing job benefits on-line
• On-line service scheduling
• Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
• scientific article; zbMATH DE number 1947413 (Why is no real title available?)
• Online flow time scheduling in the presence of preemption overhead
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Minimizing maximum (weighted) flow-time on related and unrelated machines
• Algorithm Theory - SWAT 2004
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• Rejecting jobs to minimize load and maximum flow-time
• A competitive algorithm for throughput maximization on identical machines

This page was built for publication: On-line scheduling to minimize Max flow time: an optimal preemptive algorithm

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