A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: Total tardiness minimization.
Héctor G.-de-AlbaSamuel Nucamendi-GuillénOliver Avalos-RosalesPublished in: EURO J. Comput. Optim. (2022)
Keyphrases
- mixed integer
- metaheuristic
- optimal solution
- sequence dependent setup times
- lot sizing
- tabu search
- feasible solution
- scheduling problem
- objective function
- simulated annealing
- ant colony optimization
- parallel machines
- flowshop
- linear program
- optimization problems
- mixed integer programming
- combinatorial optimization
- setup times
- valid inequalities
- search space
- convex hull
- combinatorial optimization problems
- mixed integer program
- branch and bound algorithm
- release dates
- single machine scheduling problem
- genetic algorithm
- single machine
- np hard
- precedence constraints
- vehicle routing problem
- multistage
- cutting plane
- knapsack problem
- particle swarm optimization
- lower bound
- linear programming
- production planning
- solution quality
- branch and bound
- continuous variables
- heuristic methods
- variable neighborhood search
- hybrid algorithm
- lagrangian relaxation
- column generation
- processing times
- setup cost
- mathematical programming
- evolutionary algorithm