No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373)
From MaRDI portal
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
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (English)
0 references
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
