A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678)
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 2142257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A review of exact solution methods for the non-preemptive multiprocessor flowshop problem |
scientific article; zbMATH DE number 2142257 |
Statements
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (English)
0 references
8 March 2005
0 references
Multiprocessor flowshop
0 references
Lower bounds
0 references
Branch and bound
0 references
Constraint propagation
0 references
0 references
0 references
0 references
0.92504525
0 references
0.87826276
0 references
0.86641836
0 references
0.8655988
0 references
0.86074114
0 references
0.8582073
0 references
0.8567998
0 references
