An Improved Genetic Algorithm Combining Tabu Search for Solving Flexible Job Shop Scheduling Problem with Transportation and Start-Stop Constraints.
Yifan GuHua XuRui LiJinfeng YangPublished in: ICIC (2) (2024)
Keyphrases
- tabu search
- job shop scheduling problem
- job shop scheduling
- feasible solution
- simulated annealing
- metaheuristic
- memetic algorithm
- mixed integer program
- scheduling problem
- combinatorial optimization
- search heuristics
- tabu search algorithm
- search procedure
- path relinking
- multi start
- benchmark instances
- test problems
- genetic algorithm
- search algorithm
- quadratic assignment problem
- hybrid algorithm
- initial solution
- vehicle routing problem
- combinatorial optimization problems
- benchmark problems
- iterated local search
- lp relaxation
- timetabling problem
- search algorithm for solving
- integer program
- heuristic methods
- constraint programming
- optimal solution
- tabu list
- scatter search
- global constraints
- max sat
- flowshop
- search strategy
- constraint satisfaction
- multidimensional knapsack problem
- multi objective
- search space
- distributed constraint optimization problems
- lagrangian relaxation
- simulated annealing and tabu search