A high performing metaheuristic for multi-objective flowshop scheduling problem.
Neda KarimiHamid DavoudpourPublished in: Comput. Oper. Res. (2014)
Keyphrases
- flowshop
- metaheuristic
- scheduling problem
- tabu search
- multi objective
- iterated local search
- makespan minimization
- particle swarm optimization
- genetic algorithm
- ant colony optimization
- simulated annealing
- evolutionary algorithm
- optimization problems
- minimizing makespan
- processing times
- flowshop scheduling
- setup times
- single machine
- multi objective optimization
- minimizing total tardiness
- optimization algorithm
- total flowtime
- vehicle routing problem
- maximum lateness
- memetic algorithm
- variable neighborhood search
- np hard
- permutation flowshop
- combinatorial optimization problems
- feasible solution
- multiple objectives
- combinatorial optimization
- benchmark instances
- total weighted tardiness
- optimal solution
- total tardiness
- search space
- special case
- objective function
- job shop scheduling problem
- preventive maintenance
- sequence dependent setup times
- search procedure
- test problems
- hybrid algorithm
- heuristic methods
- parallel machines
- neural network
- precedence constraints
- search algorithm
- nsga ii