Metaheuristic-Based Lagrangian Relaxation for Total Weighted Tardiness Minimization.
Czeslaw SmutnickiJaroslaw RudyRadoslaw IdzikowskiWojciech BozejkoPublished in: PCC (2) (2023)
Keyphrases
- total weighted tardiness
- lagrangian relaxation
- metaheuristic
- feasible solution
- tabu search
- optimal solution
- branch and bound algorithm
- objective function
- lower bound
- integer programming
- optimization problems
- combinatorial optimization
- ant colony optimization
- search space
- simulated annealing
- scatter search
- linear programming
- column generation
- np hard
- variable neighborhood search
- genetic algorithm
- dynamic programming
- combinatorial optimization problems
- lower and upper bounds
- vehicle routing problem
- setup times
- benchmark instances
- particle swarm optimization
- mixed integer program
- path relinking
- mixed integer programming
- shortest path
- branch and bound
- solution quality
- valid inequalities
- single machine
- neural network
- hybrid algorithm
- heuristic methods
- single machine scheduling problem
- search algorithm
- job shop
- scheduling problem
- memetic algorithm