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 ε.

• Type: Conference
• Year: 2001
• Where: ESA
• Authors: Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
• Keywords: Algorithms, Approximation Schemes, ESA 2001, Scheduling Problem, Simpler Approximation Schemes