Nikhil Bansal, José R. Correa, et al.
Mathematics of Operations Research
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.
Nikhil Bansal, José R. Correa, et al.
Mathematics of Operations Research
Maxim Sviridenko, Gerhard J. Woeginger
Annual Symposium on Foundations of Computer Science - Proceedings
Ph. Baptiste, J. Carlier, et al.
Journal of Applied and Industrial Mathematics
Alexander Kononov, Maxim Sviridenko
Operations Research Letters