Hybrid flowshop scheduling with sequence-dependent setup times by hybridizing max-min ant system, simulated annealing and variable neighbourhood search.
Javad BehnamianS. M. T. Fatemi GhomiMostafa ZandiehPublished in: Expert Syst. J. Knowl. Eng. (2012)
Keyphrases
- flowshop scheduling
- flowshop
- sequence dependent setup times
- tabu search
- simulated annealing
- scheduling problem
- metaheuristic
- processing times
- combinatorial optimization
- setup times
- feasible solution
- search procedure
- hybrid algorithm
- path relinking
- traveling salesman problem
- single machine scheduling problem
- solution quality
- benchmark problems
- genetic algorithm
- evolutionary algorithm
- single machine
- memetic algorithm
- parallel machines
- special case
- genetic algorithm ga
- heuristic methods
- particle swarm optimization pso
- vehicle routing problem
- release dates
- job shop scheduling problem
- precedence constraints
- benchmark instances
- optimization method
- branch and bound algorithm
- exact algorithms