Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings.
Alyne ToscanoDeisemara FerreiraReinaldo MorabitoPublished in: Comput. Chem. Eng. (2020)
Keyphrases
- lot sizing
- mixed integer programming
- setup times
- scheduling problem
- mixed integer
- wagner whitin
- sequence dependent setup times
- valid inequalities
- multi item
- mixed integer program
- rolling horizon
- multistage
- single item
- binary variables
- single machine
- production planning
- parallel machines
- assembly systems
- inventory systems
- lead time
- search algorithm
- cutting stock
- planning horizon
- np hard
- flowshop
- fixed cost
- cutting plane
- tabu search
- feasible solution
- optimal solution
- lot size
- precedence constraints
- upper bound
- lower bound