Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778)
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: Worst-case analysis of an approximation algorithm for flow-shop scheduling |
scientific article; zbMATH DE number 4104696
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of an approximation algorithm for flow-shop scheduling |
scientific article; zbMATH DE number 4104696 |
Statements
Worst-case analysis of an approximation algorithm for flow-shop scheduling (English)
0 references
1989
0 references
worst-case analysis
0 references
m-machine permutation flow-shop problem
0 references
tight worst-case performance ratio
0 references
