Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1306352 |
||
| Property / author | |||
| Property / author: Petra Schuurman / rank | |||
Revision as of 00:14, 23 February 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
