Results 151 to 160 of about 64,576 (188)
Some of the next articles are maybe not open access.
Journal of the Operational Research Society, 1999
A. Tuson, F. Glover, M. Laguna
openaire +2 more sources
A. Tuson, F. Glover, M. Laguna
openaire +2 more sources
2002
Tabu Search (TS) and Lagrangean relaxation (LR) are important techniques for solving large-scale combinatorial optimization problems. They have been applied successfully to a wide range of different problems from such diverse areas as routing and scheduling, network design, cutting and packing, production planning etc. In this paper we will outline how
openaire +1 more source
Tabu Search (TS) and Lagrangean relaxation (LR) are important techniques for solving large-scale combinatorial optimization problems. They have been applied successfully to a wide range of different problems from such diverse areas as routing and scheduling, network design, cutting and packing, production planning etc. In this paper we will outline how
openaire +1 more source
A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems
Journal of Manufacturing Systems, 2023Xin-Yu Li, Liang Gao, Lin Gui
exaly
1994
Tabu Search is a metastrategy for guiding known heuristics to overcome local optimality. Although still in its infancy, during the last few years successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature.
openaire +1 more source
Tabu Search is a metastrategy for guiding known heuristics to overcome local optimality. Although still in its infancy, during the last few years successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature.
openaire +1 more source