Late Acceptance Hill-Climbing Matheuristic for the General Lot Sizing and Scheduling Problem with Rich Constraints.
Andreas GoerlerEduardo Lalla-RuizStefan VoßPublished in: Algorithms (2020)
Keyphrases
- lot sizing
- hill climbing
- setup times
- scheduling problem
- mixed integer
- tabu search
- sequence dependent setup times
- multi item
- single machine
- rolling horizon
- mixed integer program
- multistage
- simulated annealing
- cutting stock
- single item
- special case
- flowshop
- genetic algorithm ga
- np hard
- planning horizon
- search algorithm
- steepest ascent
- precedence constraints
- lead time
- parallel machines
- search strategy
- search procedure
- max min
- random variables
- search space
- mixed integer programming
- genetic algorithm
- metaheuristic
- linear programming
- decision making