No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem (Q2800373)
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: No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem |
scientific article; zbMATH DE number 6195473
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem |
scientific article; zbMATH DE number 6195473 |
Statements
15 April 2016
0 references
6 August 2013
0 references
approximation
0 references
no-wait scheduling
0 references
traveling salesman problem
0 references
0 references
0 references
0 references
No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem (English)
0 references
