Bounds for the Convergence Time of Local Search in Scheduling Problems.
Tobias BrunschMichael EtscheidHeiko RöglinPublished in: WINE (2016)
Keyphrases
- scheduling problem
- job shop scheduling problem
- tabu search
- rates of convergence
- single machine
- processing times
- flowshop
- finite sample
- memetic algorithm
- upper bound
- lower bound
- search algorithm
- np hard
- genetic algorithm
- setup times
- satisfiability testing
- number of iterations required
- worst case
- job shop
- error bounds
- job shop scheduling
- upper and lower bounds
- greedy heuristics
- global search
- convergence speed
- convergence rate
- simulated annealing
- search space
- lower and upper bounds
- combinatorial optimization
- neural network
- optimal solution
- worst case bounds
- list scheduling
- graph coloring problems
- search algorithm for solving
- sequencing problems
- parallel genetic algorithm
- parallel machines
- hill climbing
- search procedure
- special case