Multi-product valid inequalities for the discrete lot-sizing and scheduling problem.
Céline GicquelMichel MinouxPublished in: Comput. Oper. Res. (2015)
Keyphrases
- lot sizing
- valid inequalities
- setup times
- mixed integer programming
- mixed integer
- production planning
- scheduling problem
- multi item
- mixed integer program
- multistage
- single item
- lead time
- continuous variables
- capacity expansion
- planning horizon
- cutting plane
- integer programming
- single machine
- fixed cost
- production cost
- flowshop
- setup cost
- linear programming
- np hard
- primal dual
- finite number
- lot size
- lp relaxation
- traveling salesman problem
- tabu search
- probabilistic model