Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386)
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 2146665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability |
scientific article; zbMATH DE number 2146665 |
Statements
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (English)
0 references
16 March 2005
0 references
scheduling
0 references
flow shop
0 references
complexity
0 references
heuristics
0 references
0.9548274
0 references
0.9360586
0 references
0.92462814
0 references
0.92326117
0 references
0.9215559
0 references
0.91764927
0 references
0.9121996
0 references
0.91196555
0 references
0.91024756
0 references
