Conference paper
Buffer overflow management in QoS switches
Alexander Kesselman, Zvi Lotker, et al.
STOC 2001
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.
Alexander Kesselman, Zvi Lotker, et al.
STOC 2001
Nikhil Bansal, Maxim Sviridenko
SODA 2004
Magnús M. Halldórsson, Guy Kortsarz, et al.
ACM Transactions on Algorithms
Ph. Baptiste, J. Carlier, et al.
Discrete Applied Mathematics