Computational complexity of some scheduling problems with multiprocessor tasks

Zinder, Y; Do, VH; Oǧuz, C

Computational complexity of some scheduling problems with multiprocessor tasks

Zinder, Y Do, VH Oǧuz, C

Permalink

Publication Type:: Journal Article
Citation:: Discrete Optimization, 2005, 2 (4), pp. 391 - 408
Issue Date:: 2005-12-01

Closed Access

	Filename	Description	Size
	2005002885.pdf		1.06 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zinder, Y	en_US
dc.contributor.author	Do, VH	en_US
dc.contributor.author	Oǧuz, C	en_US
dc.date.issued	2005-12-01	en_US
dc.identifier.citation	Discrete Optimization, 2005, 2 (4), pp. 391 - 408	en_US
dc.identifier.issn	1572-5286	en_US
dc.identifier.uri	http://hdl.handle.net/10453/4077
dc.description.abstract	The paper is concerned with scheduling problems with multiprocessor tasks and presents conditions under which such problems can be solved in polynomial time. The application of these conditions is illustrated by two quite general scheduling problems. These results are complemented by a proof of NP-hardness of the problem with a UET task system, two parallel processors, the criterion of total completion time, and precedence constraints in the form of out-trees. © 2005 Elsevier B.V. All rights reserved.	en_US
dc.relation.ispartof	Discrete Optimization	en_US
dc.relation.isbasedon	10.1016/j.disopt.2005.08.001	en_US
dc.subject.classification	Operations Research	en_US
dc.title	Computational complexity of some scheduling problems with multiprocessor tasks	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	2	en_US
utslib.for	010303 Optimisation	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
dc.location.activity	Seattle, USA
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	2	en_US

Abstract:

The paper is concerned with scheduling problems with multiprocessor tasks and presents conditions under which such problems can be solved in polynomial time. The application of these conditions is illustrated by two quite general scheduling problems. These results are complemented by a proof of NP-hardness of the problem with a UET task system, two parallel processors, the criterion of total completion time, and precedence constraints in the form of out-trees. © 2005 Elsevier B.V. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/4077