The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops (Q2709462)
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 1586161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops |
scientific article; zbMATH DE number 1586161 |
Statements
The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops (English)
0 references
13 January 2002
0 references
heuristic
0 references
scheduling
0 references
0.8952349424362183
0 references
0.8448089957237244
0 references
0.8256089091300964
0 references
0.805051326751709
0 references
