No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q5326609 |
||||||||||||||
description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6195473 | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 1336.90041 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / DOI | |||||||||||||||
Property / DOI: 10.1007/978-3-642-39206-1_65 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / published in | |||||||||||||||
Property / published in: Automata, Languages, and Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / publication date | |||||||||||||||
6 August 2013
| |||||||||||||||
Property / publication date: 6 August 2013 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 6195473 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W2133706738 / rank | |||||||||||||||
Normal rank |
Revision as of 10:03, 6 May 2024
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