A Hybrid Pareto-Based Tabu Search for Multi-objective Flexible Job Shop Scheduling Problem with E/T Penalty.
Junqing LiQuan-Ke PanShengxian XieJing LiangPublished in: ICSI (1) (2010)
Keyphrases
- multi objective
- tabu search
- simulated annealing and tabu search
- genetic algorithm
- evolutionary algorithm
- simulated annealing
- objective function
- multi objective optimization
- multiobjective optimization
- metaheuristic
- optimization algorithm
- particle swarm optimization
- scheduling problem
- job shop scheduling problem
- multiple objectives
- path relinking
- heuristic methods
- feasible solution
- memetic algorithm
- vehicle routing problem
- hybrid algorithm
- search procedure
- nsga ii
- test problems
- iterated local search
- optimization problems
- scatter search
- tabu search algorithm
- benchmark instances
- optimal solution
- multi start
- pareto optimal
- quadratic assignment problem
- tabu list
- multidimensional knapsack problem
- search algorithm
- initial solution
- neural network
- multi objective evolutionary algorithms
- evolutionary computation
- differential evolution
- benchmark problems
- job shop scheduling
- max sat
- particle swarm optimization pso
- solution space
- solution quality