The article "Solving the flexible job shop scheduling problem with sequence-dependent setup times" by Liji Shen, Stephane Dauzere-Peres, and Janis Neufeld, is accepted by the A-ranking journal European Journal of Operational Research. This study addresses the FJSP with setup times to minimize makespan. The authors first present a mathematical model to solve small instances to optimality. After studying structural properties of the problem using disjunctive graph model, a tabu search algorithm is developed with specific neighbourhood functions and a diversification structure. Test results show that the algorithm outperforms most existing approaches for the benchmark instances.