The flowshop problem is a scheduling problem where a set of jobs is processed by the same set of units or machines in the same order. A solution this problem specifies the order in which jobs are processed on each unit, to minimize a performance parameter, usually the time needed to process all tasks. In the variant of flowshop problem to be analyzed in this study, the time to process each job in each machine is stochastic, is a random varaible following a probability distribution. The aim of this study is to find an effective and efficient heuristic to solve this problem.