Conference paper
Job shop scheduling with unit processing times
Nikhil Bansal, Tracy Kimbrel, et al.
SODA 2005
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, Tracy Kimbrel, et al.
SODA 2005
Magnús M. Halldórsson, Guy Kortsarz, et al.
ACM Transactions on Algorithms
Alexander Kesselman, Zvi Lotker, et al.
SIAM Journal on Computing
Tracy Kimbrel, Malgorzata Steinder, et al.
WEA 2005