Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times.
Harry AguilarAlberto García-VilloriaRafael PastorPublished in: Comput. Oper. Res. (2023)
Keyphrases
- metaheuristic
- tabu search
- assembly line
- simulated annealing
- search procedures
- beam search
- combinatorial optimization
- optimal solution
- production line
- iterated local search
- benchmark instances
- search methods
- variable neighborhood search
- ant colony optimization
- guided local search
- optimization problems
- scatter search
- multi start
- genetic algorithm
- path relinking
- search space
- vehicle routing problem
- dantzig wolfe
- particle swarm optimization
- mip solver
- search procedure
- heuristic methods
- feasible solution
- greedy randomized adaptive search procedure
- constructive heuristic
- memetic algorithm
- hill climbing
- search algorithm
- job shop scheduling problem
- manufacturing systems
- branch and bound
- suboptimal solutions
- parallel computing
- heuristic search
- orders of magnitude
- evolutionary algorithm
- lower bound
- traveling salesman problem
- optimization method
- constraint satisfaction
- genetic algorithm ga
- exact algorithms
- worst case
- scheduling problem
- branch and bound algorithm
- optimization model
- search strategies