A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (Q1779528)
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 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network |
scientific article; zbMATH DE number 2173270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network |
scientific article; zbMATH DE number 2173270 |
Statements
A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network (English)
0 references
1 June 2005
0 references
Scheduling
0 references
Combinatorial optimization
0 references
Approximation algorithms
0 references
0 references
0.90818452835083
0 references
0.8908061385154724
0 references
0.8895981907844543
0 references
0.8876544833183289
0 references
0.886968731880188
0 references
