NSGA-II with iterated greedy for a bi-objective three-stage assembly flowshop scheduling problem.
Saulo Cunha CamposJosé Elias Claudio ArroyoPublished in: GECCO (2014)
Keyphrases
- bi objective
- scheduling problem
- nsga ii
- flowshop
- multi objective
- test problems
- multi objective optimization
- tabu search
- evolutionary algorithm
- pareto optimal
- optimal solution
- optimization problems
- np hard
- pareto optimal solutions
- multiobjective optimization
- optimization algorithm
- processing times
- flowshop scheduling
- ant colony optimization
- setup times
- multi objective evolutionary algorithms
- sequence dependent setup times
- minimizing makespan
- multiple objectives
- minimizing total tardiness
- efficient solutions
- knapsack problem
- total tardiness
- precedence constraints
- special case
- single machine
- genetic algorithm
- maximum lateness
- crossover operator
- pareto frontier
- parallel machines
- fitness function
- job shop scheduling problem
- multi objective problems
- objective function
- differential evolution
- particle swarm optimization
- approximation algorithms
- preventive maintenance
- branch and bound algorithm
- lower bound
- network design
- genetic programming
- greedy algorithm