weighted shortest processing time rule / deterministic algorithms / online job arrivals / stochastic online scheduling / exponential processing time / online scheduling / approximation algorithm / online version / deterministic online scheduling problems / online policy / minimum expected remaining processing times / improved randomized online algorithm / stochastic online scheduling model / nonpreemptive shortest expected processing time / so-called stochastic online scheduling model / deterministic processing time pj / deterministic online algorithm / stochastic job processing times / ith processing time realization / nonanticipatory online policy / attained processing time / weighted shortest expected processing time / continuous processing time distributions / deterministic processing times / stochastic online policies / deterministic algorithm / arbitrary discrete processing time distributions / distributed processing times / arbitrary processing time distributions / given attained processing time / arbitrary finite discrete processing time distributions / online setting / exponential processing times / job processing times / online way / particular processing time distributions / finite discrete processing time distribution / preemptive weighted shortest processing time / online scheduling models / approximation algorithms / shortest expected remaining processing time / deterministic job processing times / /
Organization
Nicole Megow Institut für Mathematik / Maastricht University / Technische Universität Berlin / Tjark Vredeveld Department of Quantitative Economics / /
Person
Nicole Megow / /
Position
stochastic scheduling model / stochastic scheduling model / but also online / associate editor / Dean / /
A Tight 2-Approximation for Preemptive Stochastic Scheduling