A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach

1Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a polynomial approximation scheme for the minimum makespan problem on uniform parallel processors. More specifically, the problem is to find a schedule for a set of independent jobs on a collection of machines of different speeds so that the last job to finish is completed as quickly as possible. We give a family of polynomial-time algorithms {Aϵ} such that Aϵ delivers a solution that is within a relative error of ϵ of the optimum. The technique employed is the dual approximation approach, where infeasible but superoptimal solutions for a related (dual) problem are converted to the desired feasible but possibly suboptimal solution.

Cite

CITATION STYLE

APA

Hochbaum, D. S., & Shmoys, D. B. (1986). A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 241 LNCS, pp. 382–393). Springer Verlag. https://doi.org/10.1007/3-540-17179-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free