This paper considers a specially structured n-jobs and m-machines flow shop scheduling in which the processing times are associated with probabilities. The objective of this problem focuses on minimization of the total rental cost of the machines under a specified rental policy. In recent years, researchers have suggested many heuristic procedures to minimize the makespan, but in many cases the minimization of makespan does not give the minimum rental cost of the machines. An algorithm is proposed to solve the problem