Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability

DOI10.1007/978-3-642-18318-8_21zbMath1314.90040OpenAlexW196419053MaRDI QIDQ3075465

Nicolas Schabanel, Julien Robert, Kirk R. 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

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

Related Items (1)

Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models

This page was built for publication: Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability