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 the normal view instead:
scientific article; zbMATH DE number 1347430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8806872963905334
0 references
0.8718527555465698
0 references
0.8636299967765808
0 references
