Minimizing the sum of weighted completion times in a concurrent open shop

We study minimizing the sum of weighted completion times in a concurrent open shop. We give a primaldual 2-approximation algorithm for this problem. We also show that several natural linear programming relaxations for this problem have an integrality gap of 2. Finally, we show that this problem is inapproximable within a factor strictly less than 65 if P≠NP, or strictly less than 43 if the Unique Games Conjecture also holds. © 2010 Elsevier B.V. All rights reserved.


Published in:
Oper. Res. Lett., 38, 5, 390-395
Year:
2010
Laboratories:




 Record created 2017-05-10, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)