Randomized on-line scheduling on three processors


We consider a randomized on-line scheduling problem where each job has to be scheduled on any of m identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for m= 3 processors must be strictly greater than 27 19 . c © 2003 Elsevier B.V. All rights reserved. 
DOI: 10.1016/j.orl.2003.05.003


Cite this paper

@article{Tich2004RandomizedOS, title={Randomized on-line scheduling on three processors}, author={Tom{\'a}s Tich{\'y}}, journal={Oper. Res. Lett.}, year={2004}, volume={32}, pages={152-158} }