Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

Afrati, F; Bampis, E; Chekuri, C; Karger, D; Kenyon, C; Khanna, S; Milis, I; Queyranne, M; Skutella, M; Stein, C; Sviridenko, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Bampis, E	en
dc.contributor.author	Chekuri, C	en
dc.contributor.author	Karger, D	en
dc.contributor.author	Kenyon, C	en
dc.contributor.author	Khanna, S	en
dc.contributor.author	Milis, I	en
dc.contributor.author	Queyranne, M	en
dc.contributor.author	Skutella, M	en
dc.contributor.author	Stein, C	en
dc.contributor.author	Sviridenko, M	en
dc.date.accessioned	2014-03-01T02:48:42Z
dc.date.available	2014-03-01T02:48:42Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34033
dc.subject	Approximation Scheme	en
dc.subject	Parallel Machines	en
dc.title	Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/SFFCS.1999.814574	en
heal.identifier.secondary	http://dx.doi.org/10.1109/SFFCS.1999.814574	en
heal.publicationDate	1999	en
heal.abstract	We consider the problem of scheduling jobs with re- lease dates on machines so as to minimize their average weighted completion time. We present the first known poly- nomial time approximation schemes for several variants of this problem. Our results include PTASs for the case of identical parallel machines and a constant number of unre- lated machines with and without	en
heal.journalName	IEEE Symposium on Foundations of Computer Science	en
dc.identifier.doi	10.1109/SFFCS.1999.814574	en