Scheduling on a Constant Number of Machines

Afrati, F; Bampis, E; Kenyon, C; Milis, I

dc.contributor.author	Afrati, F	en
dc.contributor.author	Bampis, E	en
dc.contributor.author	Kenyon, C	en
dc.contributor.author	Milis, I	en
dc.date.accessioned	2014-03-01T02:48:44Z
dc.date.available	2014-03-01T02:48:44Z
dc.date.issued	1999	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34062
dc.subject	Optimality Criteria	en
dc.subject	Polynomial Time Approximation Scheme	en
dc.subject	Machine Model	en
dc.title	Scheduling on a Constant Number of Machines	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-48413-4_28	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-48413-4_28	en
heal.publicationDate	1999	en
heal.abstract	We consider the problem of scheduling independent jobs on a constant number of machines. We illustrate two important approaches for obtaining polynomial time approximation schemes for two different variants of the problem, more precisely the multiprocessor-job and the unrelated-machines models, and two different optimization criteria: the makespan and the sum of weighted completion times.	en
heal.journalName	Randomization and Approximation Techniques in Computer Science	en
dc.identifier.doi	10.1007/978-3-540-48413-4_28	en