An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894)
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 unit-times tasks with precedence constraints to minimise the maximum lateness |
scientific article; zbMATH DE number 1202747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness |
scientific article; zbMATH DE number 1202747 |
Statements
An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (English)
0 references
18 March 1999
0 references
scheduling theory
0 references
unit execution times
0 references
worst-case analysis
0 references
maximum lateness
0 references
parallel identical processors
0 references
precedence constraints
0 references
approximate solution
0 references
makespan
0 references
0.9009635
0 references
0.8922682
0 references
0.8912551
0 references
0.88844585
0 references
0.88705707
0 references
0.88599896
0 references
0.88512343
0 references
0.8810296
0 references
0 references
