Non-approximability results for scheduling problems with minsum criteria (Q2884502)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Non-approximability results for scheduling problems with minsum criteria |
scientific article; zbMATH DE number 6039055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-approximability results for scheduling problems with minsum criteria |
scientific article; zbMATH DE number 6039055 |
Statements
30 May 2012
0 references
scheduling
0 references
unrelated parallel machines
0 references
open shop flow shop
0 references
APX-hardness
0 references
Non-approximability results for scheduling problems with minsum criteria (English)
0 references
