A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557)
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: A note on worst-case analysis of approximation algorithms for a scheduling problem |
scientific article; zbMATH DE number 609664
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on worst-case analysis of approximation algorithms for a scheduling problem |
scientific article; zbMATH DE number 609664 |
Statements
A note on worst-case analysis of approximation algorithms for a scheduling problem (English)
0 references
19 January 1995
0 references
performance evaluation
0 references
worst-case analysis
0 references
approximation algorithms
0 references
\(m\)-machine permutation flow-shop
0 references
0 references
