In the chemical industry, the necessity for scheduling is becoming more pronounced, especially in batch production mode. Nowadays, planning industrial activities is a necessity for survival. Intense competition requires diversified products and delivery in accordance with the requirements of consumers. These activities require quick decision making and the lowest possible cost, through an efficient Production Scheduling. So, this work addresses the Permutation Flow Shop scheduling problem, characterized as Production Scheduling in Batch Process (PSBP), with the objective of minimizing the total time to complete the schedule (Make span). A method to approach the problem of production scheduling is to turn it into Mixed Integer Linear Programming-MILP, and to solve it using commercial mathematical