Scheduling trees with large communication delays on two identical processors

Afrati, F; Bampis, E; Finta, L; Milis, I

dc.contributor.author	Afrati, F	en
dc.contributor.author	Bampis, E	en
dc.contributor.author	Finta, L	en
dc.contributor.author	Milis, I	en
dc.date.accessioned	2014-03-01T01:23:02Z
dc.date.available	2014-03-01T01:23:02Z
dc.date.issued	2005	en
dc.identifier.issn	1094-6136	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16783
dc.subject	Communication delays	en
dc.subject	Makespan	en
dc.subject	Scheduling	en
dc.subject	Trees	en
dc.subject	Two processors	en
dc.subject.classification	Engineering, Manufacturing	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	Algorithms	en
dc.subject.other	Graph theory	en
dc.subject.other	Integer programming	en
dc.subject.other	Polynomials	en
dc.subject.other	Problem solving	en
dc.subject.other	Theorem proving	en
dc.subject.other	Trees (mathematics)	en
dc.subject.other	Communication delays	en
dc.subject.other	Makespan	en
dc.subject.other	Trees	en
dc.subject.other	Two processors	en
dc.subject.other	Scheduling	en
dc.title	Scheduling trees with large communication delays on two identical processors	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s10951-005-6366-3	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s10951-005-6366-3	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	We consider the problem of scheduling trees on two identical processors in order to minimize the makespan. We assume that tasks have unit execution times, and arcs are associated with large identical integer communication delays. We prove that the problem is NP-hard in the strong sense even when restricted to the class of binary trees, and we provide a polynomial-time algorithm for complete binary trees. © 2005 Springer Science + Business Media, Inc.	en
heal.publisher	SPRINGER	en
heal.journalName	Journal of Scheduling	en
dc.identifier.doi	10.1007/s10951-005-6366-3	en
dc.identifier.isi	ISI:000228280800005	en
dc.identifier.volume	8	en
dc.identifier.issue	2	en
dc.identifier.spage	179	en
dc.identifier.epage	190	en