A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance.
Hanane KrimRachid BenmansourDavid DuvivierAbdelhakim ArtibaPublished in: RAIRO Oper. Res. (2019)
Keyphrases
- single machine scheduling problem
- search algorithm for solving
- branch and bound algorithm
- lower bound
- weighted tardiness
- scheduling problem
- processing times
- search algorithm
- release dates
- precedence constraints
- resource consumption
- tabu search
- search procedure
- single machine
- branch and bound
- np hard
- hybrid algorithm
- lagrangian relaxation
- combinatorial optimization
- upper bound
- simulated annealing
- lot sizing
- dynamic programming