Conference paper
A tale of two dimensional bin packing
Nikhil Bansal, Andrea Lodi, et al.
FOCS 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, Andrea Lodi, et al.
FOCS 2005
Nikhil Bansal, Maxim Sviridenko
SODA 2004
Markus Bläser, L. Shankar Ram, et al.
Operations Research Letters
Retsef Levi, Andrea Lodi, et al.
Mathematics of Operations Research