Genetic algorithms vs. Tabu search in timetable scheduling.
S. C. ChuH. L. FangPublished in: KES (1999)
Keyphrases
- tabu search
- scheduling problem
- feasible solution
- genetic algorithm
- job shop
- simulated annealing
- job shop scheduling problem
- memetic algorithm
- metaheuristic
- weighted tardiness
- timetabling problem
- hybrid algorithm
- path relinking
- test problems
- job shop scheduling
- single machine
- search heuristics
- vehicle routing problem
- search procedure
- iterated local search
- scatter search
- heuristic methods
- parallel machines
- search algorithm
- benchmark instances
- quadratic assignment problem
- solution quality
- initial solution
- simulated annealing and tabu search
- precedence constraints
- max sat
- tabu search algorithm
- tabu list
- np hard
- flowshop
- combinatorial optimization problems
- minimize total
- variable neighborhood search
- graph colouring
- solution space
- multidimensional knapsack problem
- global optimization
- multi start
- evolutionary computation
- round robin
- neural network