Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of an approximation algorithm for flow-shop scheduling |
scientific article |
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
