Preemptive scheduling on parallel processors with due dates

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Zinder, Y
dc.contributor.author Singh, G
dc.date.accessioned 2009-12-21T02:28:01Z
dc.date.issued 2005-12
dc.date.issued 2005-12
dc.identifier.citation Asia-Pacific Journal of Operational Research, 2005, 22 (4), pp. 445 - 462
dc.identifier.citation Asia-Pacific Journal of Operational Research, 2005, 22 (4), pp. 445 - 462
dc.identifier.issn 0217-5959
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/3425
dc.description.abstract The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing a schedule for the set of its successors. The algorithm is motivated by comparison of its nonpreemptive counterpart with other algorithms for the problem with unit execution time tasks. It is shown that the presented algorithm constructs an optimal schedule for the problem with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of processors and precedence constraints in the form of an in-tree. This proof also indicates that the presented algorithm allows the worst-case performance ratio previously established for the so-called Muntz-Coffman algorithm for a particular case of the considered problem where all due dates are zero. © World Scientific Publishing Co. & Operational Research Society of Singapore.
dc.description.abstract The paper presents a priority algorithm for the maximum lateness problem with parallel identical processors, precedence constraints, and preemptions. The presented algorithm calculates the priority of each task by constructing a schedule for the set of its successors. The algorithm is motivated by comparison of its nonpreemptive counterpart with other algorithms for the problem with unit execution time tasks. It is shown that the presented algorithm constructs an optimal schedule for the problem with two processors and arbitrary precedence constraints, and for the problem with an arbitrary number of processors and precedence constraints in the form of an in-tree. This proof also indicates that the presented algorithm allows the worst-case performance ratio previously established for the so-called Muntz-Coffman algorithm for a particular case of the considered problem where all due dates are zero. © World Scientific Publishing Co. & Operational Research Society of Singapore.
dc.language eng
dc.language eng
dc.relation.isbasedon 10.1142/S0217595905000662
dc.title Preemptive scheduling on parallel processors with due dates
dc.type Journal Article
dc.description.version Published
dc.parent Asia-Pacific Journal of Operational Research
dc.parent Asia-Pacific Journal of Operational Research
dc.journal.volume 4
dc.journal.volume 22
dc.journal.number 4 en_US
dc.publocation Singapore en_US
dc.identifier.startpage 445 en_US
dc.identifier.endpage 462 en_US
dc.cauo.name SCI.Mathematical Sciences en_US
dc.conference Verified OK en_US
dc.for 1503 Business and Management
dc.personcode 930901
dc.percentage 100 en_US
dc.classification.name Business and Management en_US
dc.classification.type FOR-08 en_US
dc.description.keywords Maximum lateness
dc.description.keywords Maximum lateness
dc.description.keywords Parallel identical processors
dc.description.keywords Parallel identical processors
dc.description.keywords Precedence constraints
dc.description.keywords Precedence constraints
dc.description.keywords Preemptions
dc.description.keywords Preemptions
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Science
utslib.copyright.status Closed Access
utslib.copyright.date 2015-04-15 12:17:09.805752+10
pubs.consider-herdc true
utslib.collection.history School of Mathematical Sciences (ID: 340)
utslib.collection.history School of Mathematical Sciences (ID: 340)
utslib.collection.history Closed (ID: 3)
utslib.collection.history Closed (ID: 3)


Files in this item

This item appears in the following Collection(s)

Show simple item record