Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine (Q4268700): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s0097539796305778 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069466073 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:11, 30 July 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
