Using dual approximation algorithms for scheduling problems: Theoretical and practical results

Abstract

The problem of scheduling a set of <italic>n</italic> jobs on <italic>m</italic> identical machines so as to minimize the makespan time is perhaps the most well-studied problem in the theory of approximation algorithms for NP-hard optimization problems. In this paper the strongest possible type of result for this problem, a polynomial approximation scheme… (More)
DOI: 10.1145/7531.7535

Topics

Cite this paper

@article{Hochbaum1985UsingDA, title={Using dual approximation algorithms for scheduling problems: Theoretical and practical results}, author={Dorit S. Hochbaum and David B. Shmoys}, journal={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, year={1985}, pages={79-89} }