A fix-and-relax heuristic for the single-item lot-sizing problem with a flow-shop system and energy constraints.
Melek RodopluTaha ArbaouiAlice YalaouiPublished in: Int. J. Prod. Res. (2020)
Keyphrases
- lot sizing
- single item
- setup times
- mixed integer
- mixed integer programming
- flowshop
- multi item
- scheduling problem
- multistage
- wagner whitin
- tabu search
- fixed cost
- lead time
- inventory systems
- production planning
- setup cost
- planning horizon
- upper bound
- valid inequalities
- search algorithm
- processing times
- dynamic programming
- infinite horizon
- long run
- supply chain
- optimal solution
- lower and upper bounds
- parallel machines
- precedence constraints
- combinatorial auctions
- integer programming
- constraint programming
- lower bound