Scheduling partially ordered UET tasks on dedicated machines

Memar, J; Singh, G; Zinder, Y

Scheduling partially ordered UET tasks on dedicated machines

Memar, J

Singh, G Zinder, Y

Permalink

Publication Type:: Conference Proceeding
Citation:: IFAC Proceedings Volumes (IFAC-PapersOnline), 2013, 46 (9), pp. 1672 - 1677
Issue Date:: 2013-01-01

Closed Access

	Filename	Description	Size
	1-s2.0-S1474667016345347-main.pdf	Published version	248.32 kB	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	Memar, J https://orcid.org/0000-0003-2395-1450	en_US
dc.contributor.author	Singh, G	en_US
dc.contributor.author	Zinder, Y	en_US
dc.date.issued	2013-01-01	en_US
dc.identifier.citation	IFAC Proceedings Volumes (IFAC-PapersOnline), 2013, 46 (9), pp. 1672 - 1677	en_US
dc.identifier.isbn	9783902823359	en_US
dc.identifier.issn	1474-6670	en_US
dc.identifier.uri	http://hdl.handle.net/10453/120769
dc.description.abstract	The paper is concerned with scheduling partially ordered unit execution time tasks on dedicated machines. The considered scheduling model is important in control of different systems, in particular computer systems. The presented algorithm is an alternative to the conventional branch-and-bound method. In contrast to the branch-and-bound method with its single search tree, corresponding to partitioning of the feasible region, the presented method involves a sequence of search trees each associated with a certain portion of the domain of the objective function. The branching is based on a generalisation of the Garey-Johnson due date modification. The performance of the presented algorithm is compared by means of computational experiments with a version of the branch-and-bound algorithm. © IFAC.	en_US
dc.relation.ispartof	IFAC Proceedings Volumes (IFAC-PapersOnline)	en_US
dc.relation.isbasedon	10.3182/20130619-3-RU-3018.00610	en_US
dc.title	Scheduling partially ordered UET tasks on dedicated machines	en_US
dc.type	Conference Proceeding
utslib.citation.volume	9	en_US
utslib.citation.volume	46	en_US
utslib.for	0199 Other Mathematical Sciences	en_US
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	9	en_US
pubs.publication-status	Published	en_US
pubs.volume	46	en_US

Abstract:

The paper is concerned with scheduling partially ordered unit execution time tasks on dedicated machines. The considered scheduling model is important in control of different systems, in particular computer systems. The presented algorithm is an alternative to the conventional branch-and-bound method. In contrast to the branch-and-bound method with its single search tree, corresponding to partitioning of the feasible region, the presented method involves a sequence of search trees each associated with a certain portion of the domain of the objective function. The branching is based on a generalisation of the Garey-Johnson due date modification. The performance of the presented algorithm is compared by means of computational experiments with a version of the branch-and-bound algorithm. © IFAC.

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

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