Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues.
Angel A. JuanHelena R. LourençoManuel MateoRachel LuoQuim CastellàPublished in: Int. Trans. Oper. Res. (2014)
Keyphrases
- iterated local search
- flowshop
- scheduling problem
- tabu search
- variable neighborhood descent
- special case
- flowshop scheduling
- processing times
- flowshop scheduling problems
- metaheuristic
- simulated annealing
- multi start
- single machine
- vehicle routing problem
- search heuristics
- np hard
- objective function
- memetic algorithm
- exact solution
- job shop scheduling problem
- vehicle routing problem with time windows
- feasible solution
- combinatorial optimization
- sufficient conditions
- lower bound