The routing open-shop problem on a network: complexity and approximation (Q2496075): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:20, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The routing open-shop problem on a network: complexity and approximation |
scientific article |
Statements
The routing open-shop problem on a network: complexity and approximation (English)
0 references
30 June 2006
0 references
heuristics
0 references
scheduling
0 references
approximation
0 references
