Modelling the machine loading problem of FMSs and its solution using a tabu-search-based heuristic.
U. M. B. S. SarmaSuman KantRahul RaiM. K. TiwariPublished in: Int. J. Comput. Integr. Manuf. (2002)
Keyphrases
- tabu search
- initial solution
- search procedure
- simulated annealing
- iterated local search
- metaheuristic
- flowshop
- feasible solution
- variable neighbourhood search
- variable neighborhood search
- scheduling problem
- quadratic assignment problem
- tabu search algorithm
- path relinking
- solution quality
- memetic algorithm
- heuristic methods
- optimal solution
- benchmark instances
- search algorithm
- job shop scheduling problem
- solution space
- test problems
- hybrid algorithm
- vehicle routing problem
- genetic algorithm
- neighborhood search
- multi start
- tabu list
- graph colouring
- scatter search
- hill climbing
- search heuristics
- lagrangian relaxation
- mixed integer program
- max sat
- multidimensional knapsack problem
- evolutionary algorithm
- lower bound
- processing times
- benchmark problems
- branch and bound algorithm
- single machine
- mathematical model
- optimization problems
- np hard
- candidate list
- simulated annealing and tabu search