Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

2013 ◽  
Vol 40 (1) ◽  
pp. 303-317 ◽  
Author(s):  
F. Seeanner ◽  
B. Almada-Lobo ◽  
H. Meyr
2009 ◽  
Vol 3 (2) ◽  
pp. 37-48
Author(s):  
Waldemar Kaczmarczyk

This paper presents some important alternatives for modelling Lot-Sizing and Scheduling Problems. First, the accuracy of models can improved by using short time buckets, which allow more detailed planning but lead to higher computational effort. Next, valid inequalities make the models tighter but increase their size. Sometimes it is possible to find a good balance between the size and tightness of a model by limiting a priori the number of valid inequalities. Finally, a special normalization of the variables simplifies the presentation of results and validation of models.


Sign in / Sign up

Export Citation Format

Share Document