A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times.
Huseyin TuncPublished in: Comput. Oper. Res. (2021)
Keyphrases
- lot sizing
- integer programming formulation
- assembly systems
- valid inequalities
- mixed integer
- mixed integer programming
- stochastic inventory control
- randomly generated
- multistage
- single item
- linear programming relaxation
- rolling horizon
- multi item
- randomly generated problems
- production planning
- single machine
- cutting stock
- lead time
- lower bound
- tabu search algorithm
- cutting plane
- optimal control
- lot size
- integer programming
- branch and bound algorithm
- bayesian networks
- genetic algorithm