A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:49, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint |
scientific article |
Statements
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (English)
0 references
13 June 2022
0 references
parallel two-stage flowshops
0 references
makespan constraint
0 references
polynomial-time approximation scheme
0 references
multiple knapsacks
0 references
rounding
0 references
