This paper presents the Flow shop problem that finds the sequence of tasks that diminishes the process production total time. The Chu-Beasley genetic algorithm is used to solve this problem. The methodology was proven with test cases of specialized Literature.