A critical-path based iterated local search for the green permutation flowshop problem.
Victor Fernandez-ViagasBruno de Athayde PrataJose M. FramiñanPublished in: Comput. Ind. Eng. (2022)
Keyphrases
- permutation flowshop
- iterated local search
- scheduling problem
- tabu search
- flowshop
- metaheuristic
- multi start
- vehicle routing problem with time windows
- upper bound
- single machine
- greedy algorithm
- setup times
- processing times
- strongly np hard
- path relinking
- vehicle routing problem
- optimization problems
- search procedure
- np hard
- neural network
- minimizing makespan
- precedence constraints
- parallel machines
- feasible solution
- simulated annealing
- search space
- scatter search
- sequence dependent setup times
- global optimization
- combinatorial optimization