نتایج جستجو برای: Tabu search
تعداد نتایج: 295057 فیلتر نتایج به سال:
Since their introduction, local search algorithms – and in particular tabu search algorithms – have consistently represented the state-of-the-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a...
A new hybrid tabu search (HTS) method for solving assembly line balancing problems is proposed in this paper. The tabu search (TS) method is combined with the genetic algorithm (GA) to identify and provide solutions for assembly line balancing problems. With the proposed HTS method, the TS method can well address the number of tasks assigned for each workstation, while the GA can also assign th...
We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors This problem is isomorphic to a variant of the multiple bin packing problem We make use of a candidate list strategy that generates only a small subset of all possible moves and employ a dynamic tabu list for handling tabu restrictions We also introduce an in uential div...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید