Lower Bounds for Smith's Rule in Stochastic Machine Scheduling [chapter]

Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
2011 Lecture Notes in Computer Science  
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 -also known as Smith's rulehas a performance guarantee of 1 2 (1 + √ 2) ≈ 1.207. They also gave an instance to show that this bound is tight. We consider the stochastic variant of this problem in which the processing times are exponentially distributed random
more » ... s. We show, somehow counterintuitively, that the performance guarantee of the WSEPT rule, the stochastic analogue of WSPT, is not better than 1.229. This constitutes the first lower bound for WSEPT in this setting, and in particular, it shows that even with exponentially distributed processing times, stochastic scheduling has somewhat nastier worst-case examples than deterministic scheduling. In that respect, our analysis sheds new light on the fundamental differences between deterministic and stochastic scheduling.
doi:10.1007/978-3-642-18318-8_13 fatcat:gomsy5gobzcmrlmpyqp2powane