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

作者：Mastrolilli Monaldo; Queyranne Maurice; Schulz Andreas S; Svensson Ola; Uhan Nelson A^*

来源：Operations Research Letters, 2010, 38(5): 390-395.

DOI：10.1016/j.orl.2010.04.011

• Scheduling
• Integrality gap
• Approximation algorithm
• Hardness of approximation

We study minimizing the sum of weighted completion times in a concurrent open shop. We give a primal-dual 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 6/5 if not equal NP, or strictly less than 4/3 if the Unique Games Conjecture also holds.

• 出版日期2010-9