An algorithm for the solution of the two-route Johnson problem (Q3033545)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4131933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the solution of the two-route Johnson problem |
scientific article; zbMATH DE number 4131933 |
Statements
An algorithm for the solution of the two-route Johnson problem (English)
0 references
1988
0 references
m-machine flow-shop scheduling
0 references
approximation algorithm
0 references
schedule length minimization
0 references
worst case accuracy bound
0 references
0 references
0 references
0.8686914
0 references
0.8651176
0 references
0.85823727
0 references
0.8559237
0 references
0.85309666
0 references
0.8515474
0 references
