In this paper, we have considered the bi-objective hybrid flow shop scheduling problem with the objectives of minimizing makespan and minimizing total tardiness. The problem is, however, a combinatorial optimization problem which is too difficult to be solved optimally, and hence, heuristics are used to obtain good solutions in a reasonable time. On the other hand, local search is a method for solving computationally hard optimization problems. Hence, we introduce a novel bi-objective local search algorithm (BOLS) to solve the problem efficiently. This local search can perform an effective search in three phases. In the initial phase, the assigned job set of a machine is moved to other machines. In the second phase, the order of jobs is changed for a machine. Finally, in phase 3, a process is done to change the assigned job set of a machine and order of jobs for a machine simultaneously. A measure of performance in literature namely free disposal hull approach and a new technique proposed by authors called “triangle method” have been used to evaluate the quality of the obtained solutions. The experimental results of the comparison between the proposed algorithm and several effective algorithms show that the BOLS is attractive for solving the bi-objective scheduling problem.