Change search
ReferencesLink to record
Permanent link

Direct link
Minimizing the sum of weighted completion times in a concurrent open shop
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
Show others and affiliations
2010 (English)In: Operations Research Letters, ISSN 0167-6377, Vol. 38, no 5, 390-395 p.Article in journal (Refereed) Published
Abstract [en]

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. (C) 2010 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
2010. Vol. 38, no 5, 390-395 p.
Keyword [en]
Scheduling, Integrality gap, Approximation algorithm, Hardness of approximation
URN: urn:nbn:se:kth:diva-46623DOI: 10.1016/j.orl.2010.04.011ISI: 000282458100012ScopusID: 2-s2.0-77957899966OAI: diva2:455140
QC 20111108Available from: 2011-11-08 Created: 2011-11-04 Last updated: 2011-11-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Svensson, Ola
By organisation
Theoretical Computer Science, TCS
In the same journal
Operations Research Letters

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 18 hits
ReferencesLink to record
Permanent link

Direct link