Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds.
Marco Antonio Cruz-ChavezJuan Frausto SolísPublished in: ICAISC (2004)
Keyphrases
- job shop scheduling problem
- simulated annealing
- upper bound
- job shop scheduling
- tabu search
- benchmark problems
- lower bound
- critical path
- genetic algorithm
- metaheuristic
- production scheduling
- upper and lower bounds
- combinatorial optimization
- evolutionary algorithm
- solution quality
- random walk
- benchmark instances
- branch and bound
- worst case
- branch and bound algorithm
- lower and upper bounds
- genetic algorithm ga
- memetic algorithm
- tabu search algorithm
- test problems
- combinatorial optimization problems
- ant colony optimization
- scheduling problem
- feasible solution
- search strategies
- multi objective
- optimal solution