Solving Multiple Capacitated Scheduling Problems with Tabu Search.
Angelo OddiPublished in: ECAI (1998)
Keyphrases
- tabu search
- scheduling problem
- vehicle routing problem
- job shop scheduling problem
- np hard
- search algorithm for solving
- metaheuristic
- job shop
- memetic algorithm
- simulated annealing
- feasible solution
- single machine
- path relinking
- flowshop
- search procedure
- search heuristics
- search algorithm
- test problems
- quadratic assignment problem
- hybrid algorithm
- genetic algorithm
- initial solution
- heuristic methods
- benchmark instances
- job shop scheduling
- setup times
- iterated local search
- precedence constraints
- routing problem
- multi start
- parallel machines
- combinatorial optimization
- tabu search algorithm
- weighted tardiness
- variable neighborhood search
- lower bound
- timetabling problem
- tabu list
- processing times
- approximation algorithms
- solution quality
- candidate list