Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645)
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: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP |
scientific article; zbMATH DE number 1294693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequencing jobs that require common resources on a single machine: A solvable case of the TSP |
scientific article; zbMATH DE number 1294693 |
Statements
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (English)
0 references
3 June 1999
0 references
asymmetric traveling salesman
0 references
one-machine scheduling
0 references
makespan
0 references
polynomial time solution algorithm
0 references
0.7633699774742126
0 references
0.7460260391235352
0 references
0.7452115416526794
0 references
