Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming.
Sara CeschiaLuca Di GasperoAndrea SchaerfPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- lot sizing
- mixed integer programming
- rolling horizon
- simulated annealing
- production planning
- setup times
- multi item
- multistage
- mixed integer
- single item
- combinatorial optimization
- valid inequalities
- cutting stock
- lead time
- setup cost
- metaheuristic
- fixed cost
- capacity expansion
- genetic algorithm
- scheduling problem
- tabu search
- planning horizon
- production cost
- lot size
- binary variables
- resource allocation
- linear programming
- evolutionary algorithm
- search algorithm