Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Petra Schuurman / rank | |||
| Property / author | |||
| Property / author: Petra Schuurman / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969964129 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-Approximability Results for Scheduling Problems with Minsum Criteria |
scientific article |
Statements
Non-Approximability Results for Scheduling Problems with Minsum Criteria (English)
0 references
30 May 2012
0 references
scheduling
0 references
unrelated parallel machines
0 references
open shop flow shop
0 references
APX-hardness
0 references
