A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q114129111, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114129111 / rank | |||
Normal rank | |||
Revision as of 17:11, 6 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
