Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.
Kathleen SteinhöfelAndreas Alexander AlbrechtChak-Kuen WongPublished in: CIAC (2000)
Keyphrases
- scheduling problem
- convergence analysis
- flowshop
- tabu search
- simulated annealing
- combinatorial optimization
- global convergence
- learning algorithm
- setup times
- single machine
- optimization methods
- np hard
- evolutionary algorithm
- job shop scheduling problem
- computational complexity
- job shop
- convergence rate
- genetic algorithm
- benchmark problems
- hill climbing
- lower bound
- nonlinear programming
- optimality conditions
- optimal solution
- sequence dependent setup times