No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2569974777 / rank | |||
Normal rank | |||
Revision as of 01:01, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem |
scientific article |
Statements
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (English)
0 references
15 April 2016
0 references
approximation
0 references
no-wait scheduling
0 references
traveling salesman problem
0 references
