Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:41, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sequencing jobs that require common resources on a single machine: A solvable case of the TSP |
scientific article |
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
