Searching for "Flow Time Minimization." – 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 →

Energy-efficient algorithms for flow time minimization
by Susanne Albers — 2006 — In Proc. STACS
…Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers Albert Ludwigs University…
Cited by 18 (1 self) – Add To MetaCart

Approximation Schemes for Flow Time on Multiple Machines
by Nikhil Bansal — 2003
… time and the maximum ow time. For minimizing total ow time, we give an algorithm which produces a 1…
Add To MetaCart

SRPT Optimally Utilizes Faster Machines to Minimize Flow Time
by Jason Mccullough, Eric Torng — 2004 — Proc. 15th Symp. on Discrete Algorithms
…SRPT Optimally Utilizes Faster Machines to Minimize Flow Time Abstract Jason McCullough ∗ and Eric…
Cited by 5 (0 self) – 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
…Nonclairvoyant Scheduling to Minimize the Total Flow Time on Single and Parallel Machines LUCA…
Cited by 8 (0 self) – Add To MetaCart

On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm ∗
by Christoph Ambühl, Monaldo Mastrolilli — 2004
…On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm ∗ Christoph Ambühl…
Add To MetaCart

P.: Metaheuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time, Working Paper
by Michael Andresen, Heidemarie Bräsel, Marc Mörig, Jan Tusch, Frank Werner, Per Willenius — 2006
…Metaheuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time Michael Andresen…
Cited by 1 (1 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

F.: Heuristic Algorithms for Open Shop Scheduling to Minmize Mean Flow Time
by Heidemarie Bräsel, André Herms, Marc Mörig, Thomas Tautenhahn, Jan Tusch, Frank Werner — 2005 — Part I: Constructive Algorithms, Preprint 30/05, FMA, Otto-von-Guericke-University Magdeburg
…Heuristic Algorithms for Open Shop Scheduling to Minimize Mean Flow Time, Part I: Constructive…
Cited by 1 (1 self) – Add To MetaCart

A Branch-and-Bound Algorithm to Solve a Two-Machine Bicriteria Flowshop Scheduling Problem
by Vincent T'Kindt, Jatinder N. D. Gupta, Jean-Charles Billaut — 2001
…-machine flow shop scheduling problem with the objective of minimizing total flow time, subject…
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

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB