A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints.
Pieter De MoerlooseBroos MaenhoutPublished in: Oper. Res. (2023)
Keyphrases
- tabu search
- scheduling problem
- combinatorial optimization
- job shop scheduling problem
- mixed integer program
- graph coloring problems
- feasible solution
- search heuristics
- memetic algorithm
- search algorithm
- strongly np hard
- simulated annealing
- precedence constraints
- np hard
- optimal solution
- timetabling problem
- metaheuristic
- linear programming problems
- dual variables
- resource constraints
- constraint satisfaction
- stochastic local search
- random sat instances
- single machine
- flowshop
- list scheduling
- initial solution
- search procedure
- primal dual
- lagrangian relaxation
- constrained problems
- vehicle routing problem
- variable neighborhood descent
- systematic search
- search procedures
- search strategies
- constraint programming
- genetic algorithm
- hill climbing
- multi start
- variable neighborhood search
- setup times
- optimization problems
- linear programming
- traveling salesman problem
- branch and bound
- partial solutions
- dynamic programming
- evolutionary algorithm
- valid inequalities