A combination of flow shop scheduling and the shortest path problem (Q2354293)
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: A combination of flow shop scheduling and the shortest path problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combination of flow shop scheduling and the shortest path problem |
scientific article |
Statements
A combination of flow shop scheduling and the shortest path problem (English)
0 references
10 July 2015
0 references
approximation algorithm
0 references
combination of optimization problems
0 references
flow shop scheduling
0 references
shortest path
0 references
0 references
0.95532084
0 references
0.92293584
0 references
0.9105495
0 references
0.8947395
0 references
0.88469577
0 references
0.88209754
0 references
0.8813733
0 references
0.87585163
0 references
