Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems.
Florian SeeannerBernardo Almada-LoboHerbert MeyrPublished in: Comput. Oper. Res. (2013)
Keyphrases
- lot sizing
- mixed integer program
- rolling horizon
- setup times
- scheduling problem
- single machine
- cutting stock
- fixed cost
- multi item
- multistage
- sequence dependent setup times
- mixed integer programming
- search algorithm
- mixed integer
- single item
- feasible solution
- search strategies
- tabu search
- production planning
- search procedure
- assembly systems
- planning horizon
- job shop scheduling problem
- processing times
- lagrangian relaxation
- linear program
- sequencing problems
- search space
- list scheduling
- optimal solution
- setup cost
- bayesian networks
- parallel machines
- optimal control
- simulated annealing
- dynamic programming
- stochastic inventory control