A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this paper, we consider the online problem of scheduling independent jobs non-preemptively so as to minimize the weighted flow-time on a set of unrelated machines. There has been a considerable amount of work on this problem in the preemptive setting where several competitive algorithms are known in the classical competitive model. However, the problem in the nonpreemptive setting admits a strong lower bound. Recently, Lucarelli et al. presented an algorithm that achieves a O 1 2doi:10.4230/lipics.esa.2018.59 dblp:conf/esa/LucarelliMTST18 fatcat:lx2xe4k2avgghd2w2wt2cqk624