When in real world, a large number of jobs and machines are taken into consideration, at that time the proper scheduling plays a vital role. Most of the industries are facing problems regarding proper scheduling. In this review paper, there are different techniques suggested for minimization of makespan for flow shop scheduling problem. Makespan is the total length of the scheduling when all jobs are done. Dispatching rule is better approach to solve the flow shop scheduling problem.Cite the Article Barai Anand N, Kagthara Manhar S. A Review on Minimization of Makespan of Flow Shop Scheduling Problem. Research & Reviews: A Journal of Embedded System & Applications. 2016; 4(3): 16–21p.