Heuristic techniques: scheduling partially ordered tasks in a multi-processor environment with tabu search and genetic algorithms.
Man LinLars KarlssonLaurence Tianruo YangPublished in: ICPADS Workshops (2000)
Keyphrases
- tabu search
- partially ordered
- scheduling problem
- multi processor
- genetic algorithm
- simulated annealing
- partial order
- job shop scheduling problem
- metaheuristic
- job shop
- memetic algorithm
- feasible solution
- precedence constraints
- heuristic methods
- path relinking
- benchmark instances
- iterated local search
- search algorithm
- program execution
- search heuristics
- hybrid algorithm
- single processor
- search procedure
- multi start
- parallel machines
- multidimensional knapsack problem
- initial solution
- variable neighborhood search
- shared memory
- scatter search
- single machine
- vehicle routing problem
- parallel processors
- np hard
- flowshop
- search space
- simulated annealing and tabu search
- solution quality
- tabu search algorithm
- special case
- totally ordered
- optimization problems
- programming environment