A mathematical model for the optimization of the capacity of machinery and labor: Job Shop Scheduling Problem (JSSP) model

Authors

Camacho, Margareth

Velastegui, Yadira

Barcia, Kleber

Abstract

Planning establishes a path that will serve to develop something: an activity, a job, or a project. Considering the limitations that may affect its development, doing it efficiently allows us to make the correct decisions so that the execution of the plan is successful. This research work seeks to develop an adequate tool by using the mathematical model JSSP (Job Shop Scheduling Problem) to plan the production and labour of a manufacturing company. The company has different machines to develop a diverse portfolio of products and only one staff template to operate this equipment, considering that the demand for the products often does not require all the working days of the month. Something that happens very often is that there are days of the month when the workforce is not enough to comply with the production plan and other days in which that same workforce does not have assigned work. This project's main objective is to optimize the production plan by maximizing productivity and minimizing costs in the area with the most significant weight in manufacturing a product: its direct labor. In this way, the company can maintain its operating expenses and be more competitive.