Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups.
Younsoo LeeKyungsik LeePublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- valid inequalities
- lot sizing
- mixed integer programming
- setup times
- mixed integer
- scheduling problem
- multi item
- multistage
- single item
- linear programming relaxation
- production planning
- cutting plane
- integer programming
- mixed integer program
- setup cost
- single machine
- np hard
- flowshop
- lagrangian relaxation
- tabu search
- planning horizon
- lead time
- traveling salesman problem
- feasible solution
- genetic algorithm
- reinforcement learning
- special case
- cost function
- lp relaxation
- linear programming
- convex hull
- lower and upper bounds