A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes (Q2663742)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes |
scientific article |
Statements
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes (English)
0 references
19 April 2021
0 references
scheduling
0 references
flow shop
0 references
routing flow shop
0 references
polynomially-solvable case
0 references
dynamic programming
0 references
