Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
On some geometric methods in scheduling theory: a survey
Discrete Applied Mathematics
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Coordination complexity of parallel price-directive decomposition
Mathematics of Operations Research
Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Better Approximation Guarantees for Job-Shop Scheduling
SIAM Journal on Discrete Mathematics
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Linear Time Approximation Scheme for the Job Shop Scheduling Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Scheduling Independent Multiprocessor Tasks
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Approximation algorithms for min-max and max-min resource sharing problems, and applications
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in the number n of jobs, and the multiplicative constant hidden in the O(n) running time is reasonably small and independent of the error Ɛ.