A Multi-objective Variable Neighborhood Search algorithm for solving the Hybrid Flow Shop Problem.
Eduardo Camargo de SiqueiraMarcone J. F. SouzaSérgio Ricardo de SouzaPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- search algorithm for solving
- flowshop
- scheduling problem
- multi objective
- tabu search
- simulated annealing and tabu search
- setup times
- evolutionary algorithm
- single machine
- multi objective optimization
- flowshop scheduling
- metaheuristic
- genetic algorithm
- processing times
- search algorithm
- maximum lateness
- objective function
- optimization algorithm
- flowshop scheduling problems
- simulated annealing
- sequence dependent setup times
- asymptotic optimality
- permutation flowshop
- particle swarm optimization
- multiobjective optimization
- np hard
- test problems
- job shop
- multiple objectives
- parallel machines
- minimizing makespan
- job shop scheduling problem
- nsga ii
- lower bound
- precedence constraints
- job shop scheduling
- unrelated parallel machines
- feasible solution
- dynamic programming
- traveling salesman problem
- open shop
- initial solution
- ant colony optimization
- lot streaming
- special case
- multistage