Combination of two-machine flow shop scheduling and shortest path problems (Q4925283)
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: Combination of two-machine flow shop scheduling and shortest path problems |
scientific article; zbMATH DE number 6174196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combination of two-machine flow shop scheduling and shortest path problems |
scientific article; zbMATH DE number 6174196 |
Statements
Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems (English)
0 references
11 June 2013
0 references
two-machine flow shop scheduling
0 references
shortest path
0 references
combination of optimization problems
0 references
approximation algorithm
0 references
0.9704326391220092
0 references
0.9131385684013368
0 references
0.9082888960838318
0 references
0.8240912556648254
0 references
0.8044633865356445
0 references
