Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine (Q1402544)
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: Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine |
scientific article; zbMATH DE number 1972172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine |
scientific article; zbMATH DE number 1972172 |
Statements
Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine (English)
0 references
28 August 2003
0 references
competitive analysis
0 references
completion time
0 references
on-line scheduling
0 references
single-machine
0 references
