Lower bounds and simulated annealing for job shop scheduling problems with blocking constrains.
Ali GorineNathalie SauerPublished in: ETFA (2010)
Keyphrases
- job shop scheduling problem
- simulated annealing
- lower bound
- tabu search
- job shop scheduling
- benchmark problems
- upper bound
- combinatorial optimization
- evolutionary algorithm
- metaheuristic
- branch and bound
- particle swarm algorithm
- branch and bound algorithm
- genetic algorithm
- genetic algorithm ga
- simulated annealing algorithm
- worst case
- hybrid algorithm
- optimization method
- np hard
- tabu search algorithm
- feasible solution
- optimal solution
- optimization methods
- objective function
- solution quality
- particle swarm optimization pso
- memetic algorithm
- neural network
- test problems
- computational intelligence
- scheduling problem
- fuzzy logic
- evolutionary computation
- optimisation problems
- particle swarm optimization