Esther M. Arkin, Refael Hassin, et al.
Algorithmica (New York)
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.
Esther M. Arkin, Refael Hassin, et al.
Algorithmica (New York)
Haim Kaplan, Moshe Lewenstein, et al.
Journal of the ACM
Guy Even, Retsef Levi, et al.
ACM Transactions on Algorithms
Viswanath Nagarajan, Maxim Sviridenko
SODA 2009