Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Shu-Zhong Zhang / rank | |||
| Property / author | |||
| Property / author: Shu-Zhong Zhang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:48, 5 March 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
