Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems |
scientific article; zbMATH DE number 6651736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems |
scientific article; zbMATH DE number 6651736 |
Statements
Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (English)
0 references
11 November 2016
0 references
GLSPMS
0 references
lot-sizing and scheduling
0 references
variable neighborhood decomposition search
0 references
VNDS
0 references
exchange
0 references
Fix\&Optimize
0 references
0 references
0 references
0 references
0 references
0.92054963
0 references
0.8933464
0 references
0.8912429
0 references
0.8862267
0 references
0.8720212
0 references
0.8654585
0 references
0.8650077
0 references
