Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup.
Desiree Maldonado CarvalhoMariá C. V. NascimentoPublished in: CoRR (2021)
Keyphrases
- parallel machines
- lot sizing
- setup times
- scheduling problem
- sequence dependent setup times
- mixed integer program
- setup cost
- total tardiness
- unrelated parallel machines
- multistage
- multi item
- single item
- precedence constraints
- rolling horizon
- strongly np hard
- production planning
- lead time
- release dates
- cutting stock
- single machine
- single server
- np hard
- flowshop
- planning horizon
- tabu search
- decision making
- parallel computing
- supply chain
- upper bound
- reinforcement learning
- genetic algorithm