Using tabu search to determine the number of kanbans and lotsizes in a generic kanban system.
Andrew D. MartinTe-Min ChangYuehwern YihRex K. KincaidPublished in: Ann. Oper. Res. (1998)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- scheduling problem
- genetic algorithm
- path relinking
- scatter search
- optimization problems
- job shop scheduling problem
- test problems
- iterated local search
- job shop
- tabu search algorithm
- memetic algorithm
- computational complexity
- heuristic methods
- initial solution
- vehicle routing problem
- hybrid algorithm
- feasible solution
- global optimization
- multi start