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

Publication Type:
Journal Article
European Journal of Operational Research, 2003, 149 (2), pp. 404 - 416
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2003000297.pdf819.16 kB
Adobe PDF
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.
Please use this identifier to cite or link to this item: