Scheduling to minimize the average completion time of dedicated tasks

Afrati, F; Bampis, E; Fishkin, AV; Jansen, K; Kenyon, C

dc.contributor.author	Afrati, F	en
dc.contributor.author	Bampis, E	en
dc.contributor.author	Fishkin, AV	en
dc.contributor.author	Jansen, K	en
dc.contributor.author	Kenyon, C	en
dc.date.accessioned	2014-03-01T01:15:52Z
dc.date.available	2014-03-01T01:15:52Z
dc.date.issued	2000	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13784
dc.subject	Polynomial Time Approximation Scheme	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	PRESPECIFIED PROCESSOR ALLOCATIONS	en
dc.subject.other	MULTIPROCESSOR	en
dc.title	Scheduling to minimize the average completion time of dedicated tasks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/3-540-44450-5_37	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-44450-5_37	en
heal.language	English	en
heal.publicationDate	2000	en
heal.abstract	We propose a polynomial time approximation scheme for schedulinga set of dedicated tasks on a constant number m of processors inorder to minimize the sum of completion times Pmjx jjPC j . In additionwe give a polynomial time approximation scheme for the weightedpreemptive problem with release dates, Pmjx j ; pmtn; r jjPw j C j .1 IntroductionIn this paper	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/3-540-44450-5_37	en
dc.identifier.isi	ISI:000170924100037	en
dc.identifier.volume	1974	en
dc.identifier.spage	454	en
dc.identifier.epage	464	en