An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem.
Quang Chieu TaJean-Charles BillautJean-Louis BouquardPublished in: RIVF (2013)
Keyphrases
- flowshop
- tabu search
- total tardiness
- hybrid metaheuristic
- lower bound
- metaheuristic
- vehicle routing problem
- scatter search
- scheduling problem
- path relinking
- variable neighborhood search
- optimal solution
- sequence dependent setup times
- simulated annealing
- np hard
- upper bound
- setup times
- feasible solution
- max sat
- memetic algorithm
- processing times
- optimization problems
- parallel machines
- branch and bound
- hybrid algorithm
- search procedure
- benchmark instances
- single machine
- genetic algorithm
- branch and bound algorithm
- heuristic methods
- search algorithm
- combinatorial optimization
- objective function
- job shop scheduling problem
- routing problem
- search space
- lower and upper bounds
- combinatorial optimization problems
- worst case
- ant colony optimization
- single machine scheduling problem
- multi objective
- lagrangian relaxation
- traveling salesman problem
- particle swarm optimization
- solution quality