A tabu search for the permutation flow shop problem with sequence dependent setup times.
Nicolau SantosRui RebeloJoão Pedro PedrosoPublished in: Int. J. Data Anal. Tech. Strateg. (2014)
Keyphrases
- tabu search
- sequence dependent setup times
- flowshop
- scheduling problem
- processing times
- simulated annealing
- metaheuristic
- setup times
- single machine
- memetic algorithm
- feasible solution
- heuristic methods
- weighted tardiness
- path relinking
- search algorithm
- genetic algorithm
- search procedure
- benchmark instances
- hybrid algorithm
- parallel machines
- vehicle routing problem
- release dates
- job shop
- scatter search
- np hard
- job shop scheduling problem
- variable neighborhood search
- single machine scheduling problem
- precedence constraints
- evolutionary algorithm
- tabu search algorithm
- candidate list
- ant colony optimization
- multistage