A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops |
scientific article |
Statements
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (English)
0 references
6 June 2019
0 references
scheduling
0 references
two-stage openshop
0 references
makespan
0 references
dynamic programming
0 references
fully polynomial-time approximation scheme
0 references
0 references
0 references
0 references
