An Enhanced Two-Level Metaheuristic Algorithm with Adaptive Hybrid Neighborhood Structures for the Job-Shop Scheduling Problem.
Pisut PongchairerksPublished in: Complex. (2020)
Keyphrases
- job shop scheduling problem
- metaheuristic
- simulated annealing
- benchmark instances
- threshold accepting
- tabu search
- makespan minimization
- optimal solution
- combinatorial optimization
- benchmark problems
- ant colony optimization
- memetic algorithm
- job shop scheduling
- critical path
- greedy randomized adaptive search procedure
- search space
- computational complexity
- combinatorial optimization problems
- optimization problems
- genetic algorithm
- objective function
- scatter search
- graph structure
- graph model
- knapsack problem
- exact algorithms
- worst case
- scheduling problem
- dynamic programming
- np hard
- cost function
- hybrid algorithm
- clustering method
- np complete
- initial solution
- particle swarm optimization
- total weighted tardiness
- guided local search