A MIP formulation and a heuristic solution approach for the bottling scheduling problem in the wine industry.
Franco BassoMauricio VarasPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- heuristic solution
- scheduling problem
- feasible solution
- tabu search
- multi commodity
- network design problem
- mixed integer programming
- np hard
- optimal solution
- knapsack problem
- lower bound
- network design
- flowshop
- metaheuristic
- linear programming
- lagrangian relaxation
- mixed integer
- simulated annealing
- minimal cost
- valid inequalities
- solution space
- genetic algorithm
- linear program
- special case
- objective function
- production planning
- exhaustive search
- integer programming
- dynamic systems
- vehicle routing problem
- upper bound