An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (Q2390265)
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 5581138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint |
scientific article; zbMATH DE number 5581138 |
Statements
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint (English)
0 references
21 July 2009
0 references
approximation algorithms
0 references
flow shop scheduling
0 references
worst-case analysis
0 references
0 references
0 references
0.9094622135162354
0 references
0.9082355499267578
0 references
0.904636800289154
0 references
0.9006125926971436
0 references
