Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search.
Christian Roed PedersenRasmus V. RasmussenKim Allan AndersenPublished in: Comput. Oper. Res. (2007)
Keyphrases
- tabu search
- scheduling problem
- flowshop
- strongly np hard
- processing times
- permutation flowshop
- parallel machines
- setup times
- precedence constraints
- single machine
- weighted tardiness
- memetic algorithm
- feasible solution
- search heuristics
- path relinking
- simulated annealing
- release dates
- minimizing makespan
- metaheuristic
- sequence dependent setup times
- job shop scheduling problem
- search algorithm for solving
- heuristic methods
- np hard
- search procedure
- vehicle routing problem
- quadratic assignment problem
- iterated local search
- search algorithm
- timetabling problem
- job shop
- initial solution
- hybrid algorithm
- benchmark instances
- combinatorial optimization
- multi start
- tabu list
- crane scheduling
- tabu search algorithm
- variable neighborhood search
- max sat
- lagrangian relaxation
- constraint satisfaction problems
- multi objective
- search space
- lower bound
- genetic algorithm