Solving a Multi-Level Capacitated Lot Sizing Problem with Random Demand via a Fix-and-Optimize heuristic.
Liuxi LiShiji SongCheng WuPublished in: CEC (2015)
Keyphrases
- multi period
- combinatorial optimization
- timetabling problem
- finding an optimal solution
- lot size
- dantzig wolfe
- multi item
- lead time
- optimal solution
- random sat instances
- planning horizon
- stochastic local search
- dynamic programming
- search algorithm
- branch and bound algorithm
- tabu search
- branch and bound search
- search heuristics
- sliding tile
- variable ordering
- lp relaxation
- production cost
- exact algorithms
- production planning
- randomly generated