A framework for designing approximation algorithms for scheduling problems

Authors:
Roberto Solis-Oba
Affiliations:
Department of Computer Science, The University of Western Ontario, London, Canada
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 5
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Approximation algorithms for scheduling

Approximation algorithms for NP-hard problems
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Job Shop Scheduling Problems with Controllable Processing Times

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Scheduling Independent Multiprocessor Tasks

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling problems have attracted the attention of the algorithms community for several decades. Al arge number of scheduling problems have been proposed and studied, and many different techniques have been devised for solving them. Among the reasons why scheduling problems are so fascinating are their rich variety, both in form and in complexity. Furthermore, there is a sea of applications for scheduling problems, which arise from an equally varied number of areas. This note briefly surveys a technique that has been successfully used to solve (or approximately solve) a large number of scheduling problems with minimax objective function.