Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags.
Imen HamdiTaïcir LoukilPublished in: CoDIT (2014)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- dynamic programming
- branch and bound algorithm
- lower bound
- column generation
- lower and upper bounds
- np hard
- linear programming
- dual decomposition
- relaxation algorithm
- capacity constraints
- mixed integer programming
- shortest path
- lagrangian heuristic
- single machine scheduling problem
- mixed integer program
- upper bound
- valid inequalities
- high dimensional
- mixed integer linear programs
- subgradient method
- branch and bound
- search algorithm
- objective function
- evolutionary algorithm
- data structure
- reinforcement learning
- machine learning