The permutation flow shop with buffers: A tabu search approach.
Eugeniusz NowickiPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- tabu search
- flowshop
- scheduling problem
- simulated annealing
- metaheuristic
- processing times
- path relinking
- test problems
- memetic algorithm
- sequence dependent setup times
- setup times
- feasible solution
- hybrid algorithm
- job shop scheduling problem
- heuristic methods
- search procedure
- genetic algorithm
- search algorithm
- vehicle routing problem
- flowshop scheduling problems
- single machine
- candidate list
- iterated local search
- job shop
- production system
- benchmark instances
- tabu search algorithm
- hill climbing
- neural network
- initial solution
- variable neighborhood search
- np hard
- scatter search
- precedence constraints
- tabu list
- particle swarm optimization
- lot streaming
- parallel machines