Approximation algorithms for a two-stage hybrid flow shop (Q4901397)
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 algorithms for a two-stage hybrid flow shop |
scientific article; zbMATH DE number 6129877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for a two-stage hybrid flow shop |
scientific article; zbMATH DE number 6129877 |
Statements
Approximation Algorithms for a Two-Stage Hybrid Flow Shop (English)
0 references
24 January 2013
0 references
flowshop scheduling
0 references
computational complexity
0 references
approximation algorithm
0 references
worst-case ratio
0 references
0.8732762336730957
0 references
0.8686897158622742
0 references
0.8675984740257263
0 references
0.8621454834938049
0 references
0.8566264510154724
0 references
