Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem.
Peter GreistorferHans KellererPublished in: J. Heuristics (2001)
Keyphrases
- tabu search
- max min
- scheduling problem
- hill climbing
- min max
- path relinking
- simulated annealing
- metaheuristic
- memetic algorithm
- flowshop
- single machine
- upper bound
- feasible solution
- test problems
- heuristic methods
- job shop scheduling problem
- lower bound
- hybrid algorithm
- vehicle routing problem
- search procedure
- initial solution
- np hard
- benchmark instances
- precedence constraints
- search algorithm
- setup times
- iterated local search
- parallel machines
- tabu search algorithm
- genetic algorithm
- processing times
- quadratic assignment problem
- worst case
- job shop
- weighted tardiness
- tabu list
- robust optimization
- lower and upper bounds
- optimization problems
- neural network
- combinatorial optimization
- multistage
- release dates
- special case