An algorithm for minimizing flow time and maximum earliness on a single machine (Q3184459)
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 5615275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for minimizing flow time and maximum earliness on a single machine |
scientific article; zbMATH DE number 5615275 |
Statements
An algorithm for minimizing flow time and maximum earliness on a single machine (English)
0 references
15 October 2009
0 references
machine scheduling
0 references
pseudo-polynomial
0 references
computational complexity
0 references
0.8304728865623474
0 references
0.8296187520027161
0 references
0.8272876739501953
0 references
