A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems.
Claudio Fabiano Motta ToledoMárcio da Silva ArantesMarcelo Yukio Bressan HossomiPaulo Morelato FrançaKerem AkartunaliPublished in: J. Heuristics (2015)
Keyphrases
- lot sizing
- cutting stock
- bin packing
- mixed integer programming
- rolling horizon
- mixed integer program
- multistage
- multi item
- setup times
- packing problem
- single item
- mixed integer
- planning horizon
- learning algorithm
- fixed cost
- bayesian networks
- supplier selection
- search algorithm
- cutting plane
- production planning
- tabu search
- lead time
- search tree
- combinatorial optimization