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

STOC

2005

ACM

2005

ACM

We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . The goal is to find a schedule that minimizes the p norm. Previous work showed a 2-approximation algorithm for the problem with respect to the norm. For any fixed p norm the previously known approximation algorithm has a performance of (p). We provide a 2-approximation algorithm for any fixed p norm (p > 1). This algorithm uses convex programming relaxation. We also give a 2approximation algorithm for the 2 norm. This algorithm relies on convex quadratic programming relaxation. To the best of our knowledge, this is the first time that general convex programming techniques (apart from SDPs and CQPs) are used in the area of scheduling. We show for any given p norm a PTAS for any fixed number of machines. We also consider the multidimensional generalization of the problem in which the jobs are d-dimensional...

Related Content

Added |
03 Dec 2009 |

Updated |
03 Dec 2009 |

Type |
Conference |

Year |
2005 |

Where |
STOC |

Authors |
Yossi Azar, Amir Epstein |

Comments (0)