Resumen de A tabu search algorithm for the Open Problem

David Alcaide López de Pablo , Joaquín Sicilia Rodríguez , Daniele Vigo

• In this paper we consider the minimum makespan Open Shop problem without preemption. It is well-known that the case with only two machines can be optimally solved in linear time, whereas the problem with an arbitrary number of machines is NP-hard in the strong sense. We propose a tabu search algorithm for the solution of the problem which uses simple list scheduling algorithms to build the starting solutions. The algorithm is extensively tested on randomly generated instances.