Scheduling UET tasks on two parallel machines with the criteria of makespan and total completion time

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Zinder, Yakov en_US
dc.contributor.author Do, Van en_US
dc.contributor.editor Kendall, G; Burke, E; Petrocic, S; Gendreau, M. en_US
dc.date.accessioned 2010-06-16T04:55:08Z
dc.date.available 2010-06-16T04:55:08Z
dc.date.issued 2005 en_US
dc.identifier 2005002911 en_US
dc.identifier.citation Zinder Yakov and Do Van Ha 2005, 'Scheduling UET tasks on two parallel machines with the criteria of makespan and total completion time', Springer, USA, pp. 83-109. en_US
dc.identifier.issn 0-387-25266-5 en_US
dc.identifier.other B1 en_US
dc.identifier.uri http://hdl.handle.net/10453/11621
dc.description.abstract Two extensions of the classical scheduling model with two parallel identical machines and a partially ordered set of unit execution time tasks are considered. It is well known that the Coffman-Graham algorithm constructs for this model a so-called ideal schedule: that is, a schedule which is optimal for both makespan and total completion time criteria simultaneously. The question of the existence of such a schedule for the extension of this model, where each task has a release time, has remained open over seneral decades. The paper gives a positive answer to this question and presents the corresponding polynormal-time algorithm.Another straightforward generalisation of the considered classcial model is obtained by the introduction of multiprocessor tasks. It is shown that, despite the fact tha a slightly modified Coffman-Graham algorithm solves the makespan problem with multiprocessor tasks for arbirtary precedence constraints, generally an ideal schedule does not exist and the problem with the criterion of total completion time turns out to be NP-hard ithe strong sense even for in-trees. en_US
dc.language en_US
dc.publisher Springer en_US
dc.relation.isbasedon en_US
dc.title Scheduling UET tasks on two parallel machines with the criteria of makespan and total completion time en_US
dc.parent Multidisciplinary Scheduling: Theory and applications en_US
dc.journal.volume en_US
dc.journal.number en_US
dc.publocation USA en_US
dc.identifier.startpage 83 en_US
dc.identifier.endpage 109 en_US
dc.cauo.name SCI.Mathematical Sciences en_US
dc.conference Verified OK en_US
dc.for 010303 en_US
dc.personcode 930901 en_US
dc.personcode 004207 en_US
dc.percentage 100 en_US
dc.classification.name Optimisation en_US
dc.classification.type FOR-08 en_US
dc.edition 1 en_US
dc.custom en_US
dc.date.activity en_US
dc.location.activity en_US
dc.description.keywords schduing, parallel machines, precedence constraints, multiprocessor tasks en_US
dc.staffid en_US
dc.staffid 004207 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record