Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes.
Lotte BerghmanFrits C. R. SpieksmaVincent T'kindtPublished in: RAIRO Oper. Res. (2021)
Keyphrases
- cutting plane
- integer program
- integer programming problems
- mixed integer program
- cutting plane algorithm
- parallel machine scheduling problem
- valid inequalities
- column generation
- mixed integer
- integer programming
- linear programming
- artificial bee colony algorithm
- quadratic programming
- linear program
- scheduling problem
- set partitioning
- knapsack problem
- release dates
- lower bound
- network flow
- lp relaxation
- objective function
- feasible solution
- traveling salesman problem
- supply chain
- computational complexity
- search algorithm
- lot sizing
- approximation algorithms
- special case
- reinforcement learning