Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints.
Stella C. S. PortoCelso C. RibeiroPublished in: J. Heuristics (1996)
Keyphrases
- tabu search
- message passing
- precedence constraints
- scheduling problem
- shared memory
- parallel machines
- belief propagation
- distributed systems
- single machine
- memetic algorithm
- job shop scheduling problem
- simulated annealing
- flowshop
- sequence dependent setup times
- metaheuristic
- feasible solution
- vehicle routing problem
- hybrid algorithm
- setup times
- np hard
- single machine scheduling problem
- release dates
- processing times
- search procedure
- parallel computing
- tabu search algorithm
- approximate inference
- branch and bound algorithm
- graphical models
- computing systems
- markov random field
- partial order
- graph cuts
- search algorithm
- neural network
- integer programming
- stereo matching