An approximation algorithm for two-machine scheduling with an availability constraint (Q3193985)
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 6500787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for two-machine scheduling with an availability constraint |
scientific article; zbMATH DE number 6500787 |
Statements
28 October 2015
0 references
scheduling problem
0 references
availability constraint
0 references
approximation algorithm
0 references
fully polynomial-time approximation scheme
0 references
0.8981398940086365
0 references
0.890386164188385
0 references
0.8852072358131409
0 references
0.8834706544876099
0 references
0.8819311261177063
0 references
