This study is focused on two-stage flowshop including batch machines and identical parallel machines and adopting makespan as the goal. At the first stage, the single batch machine can handle multiple tasks simultaneously, whereas at the second stage, the identical parallel machine can only process one task at a time. This kind of problem is called NP-hard problem. Based on Johnson’s Rule, three kinds of algorithms will be adopted and along with two lower bounds algorithms in order to solve the problem in this research.