Bi-objective scheduling of flexible flow lines: a gradual transition tabu search approach.
Mostafa ZandiehM. B. AbiriSeyed Habib A. RahmatiPublished in: Prod. Eng. (2016)
Keyphrases
- tabu search
- bi objective
- scheduling problem
- efficient solutions
- heuristic methods
- metaheuristic
- multiple objectives
- job shop
- ant colony optimization
- simulated annealing
- job shop scheduling problem
- multi objective
- weighted tardiness
- path relinking
- network design
- test problems
- feasible solution
- multi objective optimization
- memetic algorithm
- search procedure
- search algorithm
- iterated local search
- hybrid algorithm
- nsga ii
- genetic algorithm
- vehicle routing problem
- flowshop
- parallel machines
- shortest path problem
- np hard
- tabu search algorithm
- round robin
- benchmark instances
- precedence constraints
- single machine
- combinatorial optimization problems
- particle swarm optimization
- variable neighborhood search
- initial solution
- optimization problems
- tabu list
- knapsack problem
- processing times
- candidate list
- evolutionary algorithm
- linear programming
- optimization algorithm
- combinatorial optimization