Tabu search and iterated greedy for a flow shop scheduling problem with worker assignment.
Matheus de Freitas AraujoJosé Elias C. ArroyoLucas Batista FialhoPublished in: GECCO Companion (2020)
Keyphrases
- tabu search
- assembly line
- simulated annealing
- scheduling problem
- metaheuristic
- path relinking
- memetic algorithm
- feasible solution
- heuristic methods
- search procedure
- vehicle routing problem
- test problems
- search algorithm
- scatter search
- hybrid algorithm
- genetic algorithm
- processing times
- job shop scheduling problem
- iterated local search
- multidimensional knapsack problem
- flowshop
- multi start
- benchmark instances
- np hard
- precedence constraints
- initial solution
- tabu list
- tabu search algorithm
- neural network
- beam search
- max sat
- greedy algorithm
- variable neighborhood search
- optimization problems