A PTAS for minimizing the total weighted completion time on identical parallel machines
| dc.contributor.author | Skutella, Martin | |
| dc.contributor.author | J. Woeginger, Gerhard | |
| dc.date.accessioned | 2021-12-17T10:17:01Z | |
| dc.date.available | 2021-12-17T10:17:01Z | |
| dc.date.issued | 1999 | |
| dc.description.abstract | We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the strong sense. The best approximation result known so far was a ((1+ 2}))/2-approximation algorithm that has been derived by Kawaguchi and Kyan back in 1986. The contribution of this paper is a polynomial time approximation scheme for this setting, which settles a problem that was open for a long time. Moreover, our result constitutes the first known approximation scheme for a strongly NP-hard scheduling problem with minsum objective. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15943 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14716 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | approximation algorithm | en |
| dc.subject.other | approximation scheme | en |
| dc.subject.other | scheduling | en |
| dc.title | A PTAS for minimizing the total weighted completion time on identical parallel machines | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 1999, 628 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
| tub.subject.msc2000 | 68Q25 Analysis of algorithms and problem complexity | en |
| tub.subject.msc2000 | 90B35 Scheduling theory, deterministic | en |
| tub.subject.msc2000 | 68M20 Performance evaluation; queueing; scheduling | en |