Sciweavers

Share
ESA
2001
Springer

Grouping Techniques for Scheduling Problems: Simpler and Faster

9 years 8 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
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 ε.
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where ESA
Authors Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
Comments (0)
books