This essay analyzes the Economic Lot Scheduling Problem (ELSP), usually found in industries with line production processes (production follows a specified sequence of operations). Such line must manufacture different products, and it is only possible to manufacture a single product at a time. Besides, for the case studied another important characteristic exists namely, the time and setup cost depend on the chosen production sequence. The objective of the problem is to determine a production sequence that minimizes setup and inventory carrying costs, satisfying the market demand without delays. It is feasible, in theory, to find a mathematically optimal solution for the problem, but in reality it becomes impracticable due to the very large number of possibilities and the many variables to consider. For this reason, one must resort to heuristic methods. In this work, the data provided by a soft drinks manufacturer is analyzed, generating sequences and production volumes for each product, obtaining costs close to the optimum. The proposed method applies to the specific case study, and it is likely to be adaptable to a large number of industries with similar characteristics.