Minimizing maximum flowtime of jobs with arbitrary parallelizability

DOI10.1007/978-3-642-18318-8_21MaRDI QIDQ3075465zbMATHOpenAlexFDO

Authors Julien Robert, Nicolas Schabanel, Kirk Pruhs

Publication date 15 February 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-18318-8_21

Mathematics Subject Classification ID

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

Recommendations

• Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
• Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
• A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Minimizing maximum (weighted) flow-time on related and unrelated machines

Cited in

(8)

• Scheduling semi-malleable jobs to minimize mean flow time
• scientific article; zbMATH DE number 1256749 (Why is no real title available?)
• Rejecting jobs to Minimize Load and Maximum Flow-time
• Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
• On Minimizing Flow Time on Processors with Variable Unit Processing Time
• Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

This page was built for publication: Minimizing maximum flowtime of jobs with arbitrary parallelizability

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