A class of on-line scheduling algorithms to minimize total completion time (Q1811633)
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: A class of on-line scheduling algorithms to minimize total completion time |
scientific article; zbMATH DE number 1929389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of on-line scheduling algorithms to minimize total completion time |
scientific article; zbMATH DE number 1929389 |
Statements
A class of on-line scheduling algorithms to minimize total completion time (English)
0 references
17 June 2003
0 references
0 references
0 references
0.94174856
0 references
0.93955004
0 references
0.93941975
0 references
0.9289584
0 references
0.91526747
0 references
0.9143342
0 references
