A new method for solving the open shop scheduling using imperialist competitive algorithm and tabu search with regard to maintenance of machine

In this paper, the imperialist competitive algorithm (ICA) and tabu search (TS) with regard to maintenance of cars A new method is presented for complex problem Open-Shop Schedule. To test the efficiency of the proposed algorithm with genetic algorithms (GA) compared. The results show that the proposed algorithm compared with genetic algorithm in more time it needs to run all the tests, due to the combination of imperialist competitive algorithm with tabu search algorithm. The proposed algorithm on the big issues to achieve better solutions than genetic algorithms. The great advantage of the proposed algorithm is considered.