A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints.
Yannick KergosienMichel GendreauJean-Charles BillautPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- benders decomposition
- mixed integer
- scheduling problem
- tabu search
- exact algorithms
- feasible solution
- mixed integer programming
- network design problem
- optimal solution
- constraint satisfaction
- linear program
- lp relaxation
- np hard
- valid inequalities
- convex hull
- continuous variables
- approximation algorithms
- heuristic methods
- combinatorial problems
- joint distribution
- genetic algorithm
- random variables
- simulated annealing
- dynamic programming
- lot sizing
- production planning
- knapsack problem
- cutting plane
- probability distribution
- evolutionary algorithm
- distribution network
- objective function