An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative algorithm for scheduling UET tasks with due dates and release times. |
scientific article; zbMATH DE number 1957046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm for scheduling UET tasks with due dates and release times. |
scientific article; zbMATH DE number 1957046 |
Statements
An iterative algorithm for scheduling UET tasks with due dates and release times. (English)
0 references
30 July 2003
0 references
A classical scheduling problem involving Unit Execution Time (UET) tasks is considered. A new polynominal-time iterative algorithm is presented for scheduling UET task system with 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.
0 references
Scheduling
0 references
parallel processors
0 references
precedence constraints
0 references
maximum lateness
0 references
worst-case analysis
0 references
