Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (Q4268700): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:33, 6 February 2024
scientific article; zbMATH DE number 1354360
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
