In this abstract, we consider makespan minimization in the twostage hybrid flowshop. The first stage contains several identical machines and the second stage contains several batching machines. Processing time of each task is given by an interval on batching machines, and tasks of a same batch have to share a common processing time. We present two branch and bound methods to solve this problem. Direct method solves the previous problem, whereas reverse method solves the reversed problem. Several computational experiments will be presented to show the efficiency of our method.