The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders (Q5317601)
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: The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders |
scientific article; zbMATH DE number 2206277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders |
scientific article; zbMATH DE number 2206277 |
Statements
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders (English)
0 references
16 September 2005
0 references
nonpreemptive profile scheduling
0 references
list scheduling
0 references
makespan
0 references
quasi-interval order
0 references
0.8204395
0 references
0.8129227
0 references
0 references
0.78867275
0 references
0.7802619
0 references
0.77997607
0 references
0.77647257
0 references
0.7763675
0 references
0.7761307
0 references
