A Hybrid Pareto-Based Tabu Search for the Distributed Flexible Job Shop Scheduling Problem With E/T Criteria.
Jun-Qiang LiPei-Yong DuanJinde CaoXiao-Ping LinYu-Yan HanPublished in: IEEE Access (2018)
Keyphrases
- tabu search
- job shop scheduling problem
- multi objective
- simulated annealing and tabu search
- simulated annealing
- metaheuristic
- genetic algorithm
- scheduling problem
- path relinking
- memetic algorithm
- feasible solution
- job shop scheduling
- search procedure
- test problems
- quadratic assignment problem
- distributed systems
- search algorithm
- heuristic methods
- hybrid algorithm
- vehicle routing problem
- scatter search
- multi objective optimization
- iterated local search
- multi start
- tabu search algorithm
- multidimensional knapsack problem
- benchmark instances
- max sat
- optimization algorithm
- job shop
- combinatorial optimization problems
- tabu list
- candidate list
- initial solution
- benchmark problems
- solution space
- search space
- objective function