On-line scheduling on a single machine: Minimizing the total completion time (Q1306569)
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: On-line scheduling on a single machine: Minimizing the total completion time |
scientific article; zbMATH DE number 1347430
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling on a single machine: Minimizing the total completion time |
scientific article; zbMATH DE number 1347430 |
Statements
On-line scheduling on a single machine: Minimizing the total completion time (English)
0 references
9 November 1999
0 references
scheduling problem
0 references
