The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7485244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The traveling salesman problem with job-times (\textit{TSPJ}) |
scientific article; zbMATH DE number 7485244 |
Statements
The traveling salesman problem with job-times (\textit{TSPJ}) (English)
0 references
7 March 2022
0 references
traveling salesman problem
0 references
scheduling problem
0 references
assignment problem
0 references
sequence-dependent setup-time
0 references
min makespan
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7757483720779419
0 references
0.7504693269729614
0 references
0.746921181678772
0 references
0.7405014038085938
0 references
