Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm.
Shih-Wei LinKuo-Ching YingPublished in: Comput. Oper. Res. (2013)
Keyphrases
- simulated annealing algorithm
- bi objective
- multi start
- minimizing makespan
- total flowtime
- simulated annealing
- tabu search
- metaheuristic
- ant colony optimization
- flowshop
- scheduling problem
- efficient solutions
- path relinking
- multi objective
- genetic algorithm
- multi objective optimization
- evolutionary algorithm
- global optimization
- heuristic methods
- search algorithm
- vehicle routing problem
- multiple objectives
- test problems
- permutation flowshop
- nsga ii
- hybrid algorithm
- parallel machines
- combinatorial optimization
- solution space
- shortest path problem
- search procedure
- processing times
- feasible solution
- traveling salesman problem
- benchmark problems
- combinatorial optimization problems
- knapsack problem
- optimization problems
- flowshop scheduling
- particle swarm optimization pso
- solution quality
- particle swarm optimization
- genetic programming
- setup times
- np hard
- optimization algorithm
- sequence dependent setup times
- single machine
- cost function