Skip to main content
Conference Proceedings

A(2+ε)-approximation algorithm for generalized preemptive open shop problem with minsum objective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2081 361-369
DOI: 10.1007/3-540-45535-3_28
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider 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.

Cite

CITATION STYLE

APA

Queyranne, M., & Sviridenko, M. (2001). A(2+ε)-approximation algorithm for generalized preemptive open shop problem with minsum objective. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 361–369). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free