The clustered flow-shop problem (Q3798472)
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 4064755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The clustered flow-shop problem |
scientific article; zbMATH DE number 4064755 |
Statements
The clustered flow-shop problem (English)
0 references
1988
0 references
clustered flow-shop problem
0 references
minimal completion time
0 references
sufficient optimality conditions
0 references
approximate solution
0 references
0.9119914174079896
0 references
0.7898350954055786
0 references
