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 this page instead for the normal view: An algorithm for minimizing flow time and maximum earliness on a single machine |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for minimizing flow time and maximum earliness on a single machine |
scientific article |
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
