A hybrid genetic algorithm and tabu search for minimizing makespan in flow shop scheduling problem.
Moch Saiful UmamMustafid MustafidSuryono SuryonoPublished in: J. King Saud Univ. Comput. Inf. Sci. (2022)
Keyphrases
- tabu search
- minimizing makespan
- scheduling problem
- flowshop
- feasible solution
- single machine
- memetic algorithm
- metaheuristic
- test problems
- vehicle routing problem
- path relinking
- processing times
- search procedure
- simulated annealing
- np hard
- setup times
- hybrid algorithm
- job shop scheduling problem
- iterated local search
- heuristic methods
- initial solution
- quadratic assignment problem
- sequence dependent setup times
- multidimensional knapsack problem
- parallel machines
- precedence constraints
- scatter search
- tabu search algorithm
- tabu list
- benchmark instances
- search algorithm
- multi start
- solution space
- graph colouring
- candidate list
- simulated annealing and tabu search