A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem.
Noberto A. Hernández-LeandroVincent BoyerM. Angélica Salazar-AguilarLouis-Martin RousseauPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- lagrangian relaxation
- scheduling problem
- setup times
- np hard
- total weighted tardiness
- randomly generated test problems
- feasible solution
- integer programming
- single machine
- tabu search
- branch and bound algorithm
- linear programming
- lower bound
- dynamic programming
- lower and upper bounds
- flowshop
- column generation
- dual decomposition
- capacity constraints
- special case
- single machine scheduling problem
- precedence constraints
- sequence dependent setup times
- relaxation algorithm
- shortest path
- lagrangian heuristic
- processing times
- release dates
- lot sizing
- parallel machines
- linear program
- optimal solution
- valid inequalities
- mixed integer program
- approximation algorithms
- np complete
- subgradient method
- job shop scheduling problem
- neural network
- job shop
- metaheuristic
- reinforcement learning