Scheduling UET tasks on parallel machines: strength of priority algorithms

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Zinder, Y
dc.contributor.editor Cacetta, L
dc.contributor.editor Rehbock, V
dc.date.accessioned 2009-11-09T02:43:48Z
dc.date.issued 2005-01
dc.identifier.citation Proceedings of the 18th National Conference of the Australian Society for OPerations Research and the 11th Australian Optimisation Day, 2005, pp. 186 - 191
dc.identifier.isbn 1 7 4067 4219
dc.identifier.other E1 en_US
dc.identifier.uri http://hdl.handle.net/10453/1685
dc.description.abstract The paper is concerned with the problem of shceduling a partially ordered set of unit execution time tasks on parallel identical machines in ordered to minimise the criterion of maximum lateness which plays one of the central roles in scheduling theory. It is well known that the considered scheduling problem is NP-hard in the strong sense, and therefore various polynormial-time algorithms, developed for this problem are usually schracterised by their worst-case performance. For a broad class of scheduling algorithms, the paper introduces a notion of a strength, characterising their worst-case performance and within this formal framework gives a positive answer to the question of the existence of a strongest algorithm i.e. agorithm with the best worst-case performance.
dc.publisher Western Australian Centre of Excellence in Industrial Optimisation, Curtin University of Technology
dc.title Scheduling UET tasks on parallel machines: strength of priority algorithms
dc.type Conference Proceeding
dc.parent Proceedings of the 18th National Conference of the Australian Society for OPerations Research and the 11th Australian Optimisation Day
dc.journal.number en_US
dc.publocation Perth, Australia en_US
dc.publocation Sydney, NSW
dc.publocation Perth, Australia
dc.publocation Perth, Australia
dc.publocation Perth, Australia
dc.publocation Perth, Australia
dc.identifier.startpage 186 en_US
dc.identifier.endpage 191 en_US
dc.cauo.name SCI.Mathematical Sciences en_US
dc.conference Verified OK en_US
dc.conference International Conference on Web Engineering
dc.conference National Conference of theAustralian Society for Operation Research
dc.conference National Conference of theAustralian Society for Operation Research
dc.conference National Conference of theAustralian Society for Operation Research
dc.conference National Conference of theAustralian Society for Operation Research
dc.conference.location Perth, Australia en_US
dc.for 010303 Optimisation
dc.personcode 930901
dc.percentage 100 en_US
dc.classification.name Optimisation en_US
dc.classification.type FOR-08 en_US
dc.custom National Conference of theAustralian Society for Operation Research en_US
dc.date.activity 20050929 en_US
dc.date.activity 2005-07-25
dc.date.activity 2005-09-29
dc.date.activity 2005-09-29
dc.date.activity 2005-09-29
dc.date.activity 2005-09-29
dc.location.activity Perth, Australia en_US
dc.location.activity Sydney, Australia
dc.location.activity Perth, Australia
dc.location.activity Perth, Australia
dc.location.activity Perth, Australia
dc.location.activity Perth, Australia
pubs.embargo.period Not known
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 Sciences


Files in this item

This item appears in the following Collection(s)

Show simple item record