An exact solution with an improved running time for the routing flow shop problem with two machines (Q6620464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact solution with an improved running time for the routing flow shop problem with two machines |
scientific article; zbMATH DE number 7927840
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact solution with an improved running time for the routing flow shop problem with two machines |
scientific article; zbMATH DE number 7927840 |
Statements
An exact solution with an improved running time for the routing flow shop problem with two machines (English)
0 references
16 October 2024
0 references
scheduling
0 references
routing flow shop
0 references
polynomially solvable case
0 references
dynamic programming
0 references
0 references
