An efficient metaheuristic for the blocking job shop problem with the makespan minimization.
Jie ZhuXiaoping LiPublished in: ICMLC (2011)
Keyphrases
- makespan minimization
- metaheuristic
- job shop scheduling problem
- tabu search
- simulated annealing
- combinatorial optimization problems
- optimization problems
- ant colony optimization
- search space
- combinatorial optimization
- scatter search
- job shop scheduling
- genetic algorithm
- optimal solution
- particle swarm optimization
- path relinking
- vehicle routing problem
- total weighted tardiness
- memetic algorithm
- scheduling problem
- job shop
- graph model
- benchmark instances
- single machine
- flowshop
- special case
- processing times
- benchmark problems
- variable neighborhood search
- neural network
- lower bound
- objective function
- hybrid algorithm