A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (Q732786)
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 ( 43)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints |
scientific article; zbMATH DE number 5615336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints |
scientific article; zbMATH DE number 5615336 |
Statements
A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints (English)
0 references
15 October 2009
0 references
flow shop scheduling
0 references
availability constraint
0 references
approximation algorithms
0 references
error bound
0 references
0 references
0 references
0 references
0 references
0.93820405
0 references
0.93630105
0 references
0.9354798
0 references
0.93051493
0 references
0.9246074
0 references
0.9176345
0 references
0 references
0 references
0.9078078
0 references
