Flow shop scheduling problem has a lot of applications in industry. Many researchers have worked and are working on this subject so a lot of papers are being published in this field in scientific journals every year. Most of these papers are about minimizing makespan in flow shop production environment. But, more and less, researches with other objectives or with specific hypothesis are done in such production environments. In the other way, production smoothing also has assigned an extensive part of researches to itself. The importance of it, especially in Just in Time production environments, has attracted the interests of many researchers. However, there are a little works on those above mentioned cases, simultaneously. Flow shop scheduling problem with sequence dependent set-up times is considered in this paper. The objective is minimizing the makespan by considering production smoothing. Here, the smoothing is decreasing the deviation of production rate of jobs of using rate of them. It is shown that solving of this problem is NP-hard. A Branch and Bound (B am) algorithm is suggested to solve the problem. Also, a heuristic algorithm with rather good solving is used to analyze the results in larger problems. The B am algorithm is applied to 2040 test problems with three amounts of ? parameter and once without the parameter. It is shown that the suggested algorithm is able to reach to optimum solving for problems with maximum 14 places.
