Searching for "Minimizing Average Flow-Time." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

26 documents found, showing 1 through 10. Next 10 →

Minimizing Average Flow-time: Upper and Lower Bounds Abstract
by Naveen Garg
…Minimizing Average Flow-time : Upper and Lower Bounds Abstract Naveen Garg naveen…
Add To MetaCart

Getting the Best Response for Your Erg
by Kirk Pruhs Patchrawat, Kirk Pruhs, Patchrawat Uthaisombut, Gerhard Woeginger — 2004 — In Scandanavian Workshop on Algorithms and Theory
… ‡ Abstract We consider the bi-criteria problem of minimizing the average flow time (average response time…
Add To MetaCart

On the Competitiveness of AIMD-TCP within a General Network Submitted to Journal Theoretical Computer
by Jeff Edmonds — 2004 — Science Lecture Notes in Computer Science, Volume 2976/2004. LATIN, Latin American Theoretical Informatics
… in minimizing the average flow time of the jobs. Keywords: AIMD, TCP, online competitive ratio, flow time…
Cited by 3 (3 self) – Add To MetaCart

A maiden analysis of Longest Wait First
by Jeff Edmonds, Kirk Pruhs — 2004 — Proc. of the 15th Annual ACMSIAM Symposium on Discrete Algorithms
… scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform…
Cited by 6 (1 self) – Add To MetaCart

A Maiden Analysis of Longest Wait First
by Jeff Edmonds Kirk, Kirk Pruhs — 2004 — Proc. of the 15th Annual ACMSIAM Symposium on Discrete Algorithms
… scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform…
Add To MetaCart

unknown title
by Optimally Competitive, List Batching, Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
… average flow time. We present optimally competitive algorithms for s-batch (competitive ratio 2) and p…
Add To MetaCart

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
by Luca Becchetti, Stefano Leonardi — Journal of the ACM
… for nonclairvoyant average flow time minimization on parallel machines. This compares with the �(log n ) and �(log P…
Cited by 8 (0 self) – Add To MetaCart

Simulation Studies for the Online Dial-a-Ride Problem
by Martin Grötschel, Martin Gr, Otschel Dietrich Hauptmeier, Jörg Rambau, Martin Gr Otschel, Dietrich Hauptmeier, Sven O. Krumke, Sven O. Krumke, J Org Rambau, J Org Rambau — 1999
… reflected by the following two objectives: ffl minimize the average flow time, where the flow time of a…
Cited by 1 (0 self) – Add To MetaCart

Online-optimization of a multi-elevator transport system with reoptimization algorithms based on set-partitioning models
by Philipp Friese, Jörg Rambau — 2005 — Discrete and Applied Mathematics, special issue on the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA’04
… or the maximal flow times) are minimized. We show that a reoptimization policy for minimizing average squared…
Cited by 2 (1 self) – Add To MetaCart

Optimal Time-Critical Scheduling Via Resource Augmentation
by Extend Ed, Cynthia A. Phillips, Cliff Stein, Eric Torng, Joel Wein
… by their deadlines, and ffl on-line multiprocessor scheduling of sequential jobs to minimize average flow time…
Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB