A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem.
Cathy WolosewiczStéphane Dauzère-PérèsRiad AggounePublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- lot sizing
- lagrangian heuristic
- setup times
- mixed integer
- scheduling problem
- multi item
- rolling horizon
- single machine
- multistage
- single item
- lagrangian relaxation
- mixed integer programming
- parallel machines
- flowshop
- ordering cost
- lead time
- production planning
- processing times
- cutting plane
- setup cost
- tabu search
- np hard
- planning horizon
- branch and bound
- network design problem
- cutting stock
- valid inequalities
- lot size
- fixed cost
- lower bound
- probability distribution
- special case
- computational complexity
- search algorithm
- reinforcement learning
- bayesian networks