Mathematical Model of Mixed Linear Programming for Aggregate Planning with Various Approaches
摘要
The development of aggregate plans within the manufacturing industries provides benefits by seeking a balance between capacity and existing demand within the periods in the planning horizon, taking better advantage of the resources they possess. This article proposes a mixed linear programming mathematical model that allows solving four aggregate planning approaches to minimize costs: 1. Level capacity with the current workforce, using overtime and subcontracting; 2. Level capacity with inventories, overtime, and subcontracting, allowing hiring or firing in the first period; 3. Coinciding with demand by varying the workforce and 4. Mixed, where all the variables are optimally combined. The model has been solved in the Lingo software, programming it to solve the four approaches together, to reduce the time needed to develop this type of plan and to be used by the industries that require it.