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...

This paper investigates the capabilities of tabu search for solving the global path planning problem in grid maps. Accordingly, a tabu search system model is designed and a tabu search planner algorithm for solving the path planning problem is proposed. A comprehensive simulation study is conducted using the proposed model and algorithm, in terms of solution quality and execution time. A compar...

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequenceand machinedependent setup times to minimize the schedule’s makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm...

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 innuential...

Alan turing work is related with the first use of heuristic algorithms. His work on broking the Nazi code of the Enigma cipher was oriented by a guided search whose expected result in most of the times would be the deciphering of the codes, even though sometimes it might not work. This idea reflects the modern meaning of an heuristic, and represents the main relationship with this chapter, as i...