Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

EOR
2002

favoriteEmaildiscussreport

79views more EOR 2002»

Fast fully polynomial approximation schemes for minimizing completion time variance

13 years 10 months ago

Fast fully polynomial approximation schemes for minimizing completion time variance

Download wawel.busi.mun.ca

Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these schemes runs in time O(n2 / ) and thus improves on all fully polynomial approximation schemes presented in the literature.

Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyo

Real-time Traffic

Completion Time Variance | EOR 2002 | Polynomial Approximation Schemes |

claim paper

Related Content

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» A faster approximation scheme for timing driven minimum cost layer assignment

» Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

» Polynomial Time Approximations for MultiPath Routing with Bandwidth and Delay Constraints

» Approximation scheme for restricted discrete gate sizing targeting delay minimization

» The Constrained Minimum Weighted Sum of Job Completion Times Problem

» A Fast 52Approximation Algorithm for Hierarchical Scheduling

» Connection Preemption in MultiClass Networks

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	EOR
Authors	Wieslaw Kubiak, Jinliang Cheng, Mikhail Y. Kovalyov

Comments (0)