Magnús M. Halldórsson, Guy Kortsarz, et al.
ACM Transactions on Algorithms
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.
Magnús M. Halldórsson, Guy Kortsarz, et al.
ACM Transactions on Algorithms
Nikhil Bansal, Don Coppersmith, et al.
SODA 2006
Jon Lee, Maxim Sviridenko, et al.
SIAM Journal on Computing
Nikhil Bansal, Tracy Kimbrel, et al.
SODA 2005