The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. (Q5928378)
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 1582544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. |
scientific article; zbMATH DE number 1582544 |
Statements
The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops. (English)
0 references
28 March 2001
0 references
0 references
0 references
0 references
0 references
0 references
0.8952349424362183
0 references
0.8850600719451904
0 references
0.8223466873168945
0 references
0.815680980682373
0 references
0.8073285818099976
0 references
