Transportation time incorporate in flexible job shop scheduling. We mathematically formulate the problem by two mixed integer linear programming models. We propose a novel imperialist competitive algorithm hybridized by a simulated annealing. The proposed algorithm is evaluated by comparing against two high performing algorithms.