A tabu search-based memetic algorithm for the multi-objective flexible job shop scheduling problem.
Marios KefalasSteffen LimmerAsteris ApostolidisMarkus OlhoferMichael EmmerichThomas BäckPublished in: GECCO (Companion) (2019)
Keyphrases
- multi objective
- memetic algorithm
- tabu search
- genetic algorithm
- simulated annealing
- evolutionary algorithm
- metaheuristic
- job shop scheduling problem
- multi objective optimization
- optimization algorithm
- feasible solution
- path relinking
- particle swarm optimization
- benchmark instances
- timetabling problem
- scheduling problem
- search procedure
- heuristic methods
- hybrid algorithm
- search algorithm
- test problems
- initial solution
- iterated local search
- objective function
- vehicle routing problem
- scatter search
- flowshop
- variable neighborhood search
- tabu list
- optimization problems
- multi start
- nsga ii
- job shop
- job shop scheduling
- quadratic assignment problem
- simulated annealing and tabu search
- differential evolution
- search methods
- ant colony optimization
- fitness function
- genetic algorithm ga
- crossover operator