Approximation in Preemptive Stochastic Online Scheduling
We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive a policy with a guaranteed performance ratio of 2 which matches the currently best known result for the corresponding deterministic online problem.
Our policy applies to the recently introduced stochastic online scheduling model in which jobs arrive online over time. In contrast to the previously considered nonpreemptive setting, our preemptive policy extensively utilizes information on processing time distributions other than the first (and second) moments. In order to derive our result we introduce a new nontrivial lower bound on the expected value of an unknown optimal policy that we derive from an optimal policy for the basic problem on a single machine without release dates. This problem is known to be solved optimally by a Gittins index priority rule. This priority index also inspires the design of our policy.
KeywordsSchedule Problem Optimal Policy Release Date Parallel Machine Single Machine
Unable to display preview. Download preview PDF.
- 4.Chou, M.C., Liu, H., Queyranne, M., Simchi-Levi, D.: On the asymptotic optimality of a simple on-line algorithm for the stochastic single machine weighted completion time problem and its extensions, Operations Research (to appear, 2006)Google Scholar
- 12.Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 245–261. Academic Press, New York (1984)Google Scholar
- 15.Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Mathematics of Operations Research (to appear, 2006)Google Scholar
- 16.Megow, N., Vredeveld, T.: Approximation results for preemptive stochastic online scheduling. Technical Report 8/2006, Technische Universität Berlin (April 2006)Google Scholar
- 20.Pinedo, M.: Off-line deterministic scheduling, stochastic scheduling, and online deterministic scheduling: A comparative overview. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, vol. 38. CRC Press, Boca Raton (2004)Google Scholar
- 21.Schulz, A.S.: New old algorithms for stochastic scheduling. In: Albers, S., Möhring, R.H., Pflug, G.C., Schultz, R. (eds.) Algorithms for Optimization with Incomplete Information, Dagstuhl Seminar Proceedings, vol. 05031 (2005)Google Scholar
- 25.Sitters, R.A.: Complexity and Approximation in Routing and Scheduling. PhD thesis, Technische Universiteit Eindhoven (2004)Google Scholar