Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-18318-8_21 ◽

2011 ◽

pp. 237-248 ◽

Author(s):

Kirk Pruhs ◽

Julien Robert ◽

Nicolas Schabanel

Download Full-text