Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (Q4268700)
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 1354360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine |
scientific article; zbMATH DE number 1354360 |
Statements
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (English)
0 references
28 October 1999
0 references
scheduling
0 references
approximation algorithm
0 references
worst-case analysis
0 references
total flow time
0 references
release time
0 references
single machine
0 references
0.8825125694274902
0 references
0.8668537139892578
0 references
