Scheduling UET-UCT tasks: branch-and-bound search in the priority space

Zinder, Y; Singh, G; Su, B; Sorli, RM

Scheduling UET-UCT tasks: branch-and-bound search in the priority space

Zinder, Y Singh, G Su, B Sorli, RM

Permalink

Publisher:: Universal Academy Press Inc
Publication Type:: Conference Proceeding
Citation:: 7th International conference on optimisation: techniques and applications (ICOTA7), 2007, pp. 1 - 12
Issue Date:: 2007-01

Closed Access

	Filename	Description	Size
	2007001581.pdf		1.77 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	Singh, G	en_US
dc.contributor.author	Su, B	en_US
dc.contributor.author	Sorli, RM	en_US
dc.contributor.editor	Fukushima, M	en_US
dc.contributor.editor	Lau, MS	en_US
dc.contributor.editor	Nakayama, H	en_US
dc.contributor.editor	Nitta, N	en_US
dc.contributor.editor	Tanaka, M	en_US
dc.contributor.editor	Tatsumi, K	en_US
dc.contributor.editor	Wada, M	en_US
dc.contributor.editor	Wakatani, A	en_US
dc.contributor.editor	Watanabe, E	en_US
dc.contributor.editor	Yamashita, N	en_US
dc.contributor.editor	Yue, W	en_US
dc.date	2007-12-12	en_US
dc.date.issued	2007-01	en_US
dc.identifier.citation	7th International conference on optimisation: techniques and applications (ICOTA7), 2007, pp. 1 - 12	en_US
dc.identifier.isbn	978-4-946443-15-2	en_US
dc.identifier.uri	http://hdl.handle.net/10453/6640
dc.description.abstract	The paper is concerned iwth the problem of scheduling partially ordered unit execution time tasks on parallel processors with unit communication delays and release times. Two criteria are considered the maximum lateness and its particular case, the makespan. This problem plays an important role in scheduling theoery and was originally inspired by the applications to the multi-processor computer systems	en_US
dc.publisher	Universal Academy Press Inc	en_US
dc.relation.ispartof	7th International conference on optimisation: techniques and applications (ICOTA7)	en_US
dc.relation.ispartof	International Conference on Optimization: Techniques And Applications	en_US
dc.title	Scheduling UET-UCT tasks: branch-and-bound search in the priority space	en_US
dc.type	Conference Proceeding
utslib.location	Kobe, Japan	en_US
utslib.location.activity	Kobe, Japan	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
dc.location.activity	Kobe, Japan	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
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical Sciences
utslib.copyright.status	closed_access
pubs.consider-herdc	true	en_US
pubs.place-of-publication	Kobe, Japan	en_US
pubs.start-date	2007-12-12	en_US

Abstract:

The paper is concerned iwth the problem of scheduling partially ordered unit execution time tasks on parallel processors with unit communication delays and release times. Two criteria are considered the maximum lateness and its particular case, the makespan. This problem plays an important role in scheduling theoery and was originally inspired by the applications to the multi-processor computer systems

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

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