Approximation results for flow shop scheduling problems with machine availability constraints (Q954036)
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: Approximation results for flow shop scheduling problems with machine availability constraints |
scientific article; zbMATH DE number 5363305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation results for flow shop scheduling problems with machine availability constraints |
scientific article; zbMATH DE number 5363305 |
Statements
Approximation results for flow shop scheduling problems with machine availability constraints (English)
0 references
7 November 2008
0 references
flow shop scheduling
0 references
machine non-availability
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9393638968467712
0 references
0.9094622135162354
0 references
0.9057143926620485
0 references
0.8919526934623718
0 references
