A New Bi-Objective Batch Scheduling Problem: NSGA-II-and-Local-Search-Based Memetic Algorithms.
ZiYan ZhaoShixin LiuMengChu ZhouPublished in: SMC (2020)
Keyphrases
- memetic algorithm
- nsga ii
- bi objective
- tabu search
- test problems
- scheduling problem
- multi objective
- crossover operator
- multiobjective evolutionary algorithm
- pareto optimal
- multiobjective optimization
- job shop scheduling problem
- multi objective optimization
- genetic algorithm
- constrained multi objective optimization problems
- flowshop
- single machine
- evolutionary algorithm
- np hard
- metaheuristic
- simulated annealing
- pareto optimal solutions
- optimal solution
- feasible solution
- vehicle routing problem
- evolutionary multiobjective
- processing times
- optimization algorithm
- multi objective problems
- uniform design
- multi objective evolutionary algorithms
- optimization problems
- search algorithm
- heuristic methods
- pareto dominance
- knapsack problem
- neural network
- differential evolution
- precedence constraints
- multi criteria
- pareto frontier
- objective function
- genetic programming
- linear programming
- efficient solutions
- fuzzy logic
- lower bound
- combinatorial optimization
- solution quality