Jon Lee, Maxim Sviridenko, et al.
SIAM Journal on Computing
In this paper we consider a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective. The main result is a (2 + ε)-approximation algorithm for this problem. In the last section we also discuss the possibility of improving our algorithm. © 2002 Elsevier Science (USA). All rights reserved.
Jon Lee, Maxim Sviridenko, et al.
SIAM Journal on Computing
Nikhil Bansal, Maxim Sviridenko
STOC 2006
Nikhil Bansal, Andrea Lodi, et al.
FOCS 2005
Nikhil Bansal, Xin Han, et al.
SODA 2007