An iterative algorithm for scheduling UET tasks with due dates and release times
UTSePress Research/Manakin Repository
JavaScript is disabled for your browser. Some features of this site may not work without it.
- UTSePress Research Home
- >
- 01 Mathematical Sciences
- >
- Journal Articles
- >
- Closed
- >
- View Item
| dc.contributor.author | Zinder Yakov | en_US |
| dc.date.accessioned | 2009-12-21T02:27:53Z | |
| dc.date.available | 2009-12-21T02:27:53Z | |
| dc.date.issued | 2005 | en_US |
| dc.identifier | 2003000297 | en_US |
| dc.identifier.citation | Zinder Yakov 2003, 'An iterative algorithm for scheduling UET tasks with due dates and release times', Elsevier Science Bv, vol. 149, no. 2, pp. 404-416. | en_US |
| dc.identifier.issn | 0377-2217 | en_US |
| dc.identifier.other | C1 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10453/3388 | |
| dc.description.abstract | A new polynomial-time iterative algorithm is presented for the scheduling problem with a unit execution time task system, parallel identical processors, precedence constraints, release times, and the criterion of maximum lateness. For the maximum lateness and makespan problems the algorithm allows to achieve the performance guarantees previously known only for the problems without release times. | en_US |
| dc.publisher | Elsevier Science | en_US |
| dc.relation.isbasedon | http://dx.doi.org/10.1016/j.jedc.2003.04.010 | en_US |
| dc.title | An iterative algorithm for scheduling UET tasks with due dates and release times | en_US |
| dc.parent | European Journal Of Operational Research | en_US |
| dc.journal.volume | 149 | en_US |
| 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 |
