Minimizing maximum flowtime of jobs with arbitrary parallelizability

DOI10.1007/978-3-642-18318-8_21zbMATH Open1314.90040OpenAlexW196419053MaRDI QIDQ3075465FDOQ3075465

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Rejecting jobs to Minimize Load and Maximum Flow-time
• Title not available (Why is that?)
• Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time
• Scheduling semi-malleable jobs to minimize mean flow time
• On Minimizing Flow Time on Processors with Variable Unit Processing 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
• 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)