Tabu search and lower bound for an industrial complex shop scheduling problem.
Damien ProtOdile Bellenguez-MorineauPublished in: Comput. Ind. Eng. (2012)
Keyphrases
- tabu search
- scheduling problem
- lower bound
- simulated annealing
- np hard
- metaheuristic
- quadratic assignment problem
- feasible solution
- upper bound
- path relinking
- memetic algorithm
- search algorithm
- job shop scheduling problem
- flowshop
- heuristic methods
- max sat
- vehicle routing problem
- test problems
- single machine
- hybrid algorithm
- genetic algorithm
- iterated local search
- optimal solution
- benchmark instances
- precedence constraints
- setup times
- job shop
- search procedure
- multi start
- branch and bound algorithm
- branch and bound
- initial solution
- candidate list
- scatter search
- multidimensional knapsack problem
- crane scheduling
- parallel machines
- processing times
- evolutionary algorithm
- objective function