Abstract: In this paper, the multi-objective flexible job shop scheduling problem (FJSP) and the basic bat algorithm are introduced at first. Secondly, the basic bat algorithm is improved and combined with the variable neighborhood search algorithm to obtain a new hybrid bat algorithm (HBA). In HBA, an individual position vector representation method and the conversion mechanism between the individual position vector and the scheduling solution are designed. In addition, a population initialization scheme and two neighborhood structures are given, and a variable neighborhood algorithm is introduced to enhance the searching ability. Finally, benchmark instances are simulated to demonstrate the effectiveness of the proposed algorithm.