Lower Bounds for Smith's Rule in Stochastic Machine Scheduling

We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed that scheduling the jobs according to the WSPT rule

• Type: Journal
• Year: 2010
• Where: WAOA
• Authors: Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
• Keywords: Algorithms, Completion Times, Parallel Machine Scheduling, WAOA 2010, Weighted Sum