An iterative algorithm for scheduling UET tasks with due dates and release times

DSpace/Manakin Repository

Search OPUS


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Zinder, Y
dc.date.accessioned 2009-12-21T02:27:53Z
dc.date.issued 2003-09-01
dc.identifier.citation European Journal of Operational Research, 2003, 149 (2), pp. 404 - 416
dc.identifier.citation European Journal of Operational Research, 2003, 149 (2), pp. 404 - 416
dc.identifier.issn 0377-2217
dc.identifier.other C1 en_US
dc.identifier.uri http://hdl.handle.net/10453/3388
dc.description.abstract A new polynomial-time iterative algorithm was studied for the scheduling problem with due dates, parallel identical processors, and release times. Each processor can process only one task at a time, and each task can be processes by nay processor. For the maximum lateness and makespan problems the algorithm allows to achieve the performance guarantees; earlier known only for the problems without release times.
dc.description.abstract A new polynomial-time iterative algorithm was studied for the scheduling problem with due dates, parallel identical processors, and release times. Each processor can process only one task at a time, and each task can be processes by nay processor. For the maximum lateness and makespan problems the algorithm allows to achieve the performance guarantees; earlier known only for the problems without release times.
dc.language eng
dc.language eng
dc.relation.isbasedon 10.1016/S0377-2217(02)00770-1
dc.title An iterative algorithm for scheduling UET tasks with due dates and release times
dc.type Journal Article
dc.description.version Published
dc.parent European Journal of Operational Research
dc.parent European Journal of Operational Research
dc.journal.volume 2
dc.journal.volume 149
dc.journal.number 2 en_US
dc.publocation Amsterdam, The Netherlands en_US
dc.identifier.startpage 31 en_US
dc.identifier.endpage 62 en_US
dc.cauo.name Finance and Economics en_US
dc.for 010206 Operations Research
dc.personcode 930901
dc.location.activity UNIV OSNABRUCK, MATH INFORMAT DEPT, OSNABRUCK, GERMANY
dc.description.keywords Maximum lateness
dc.description.keywords Maximum lateness
dc.description.keywords Parallel processors
dc.description.keywords Parallel processors
dc.description.keywords Precedence constraints
dc.description.keywords Precedence constraints
dc.description.keywords Scheduling
dc.description.keywords Scheduling
dc.description.keywords Worst-case analysis
dc.description.keywords Worst-case analysis
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 Closed (ID: 3)


Files in this item

This item appears in the following Collection(s)

Show simple item record