Multi-objective, Multi-mode Workforce and Task Scheduling in an International Assembly Company

This study deals with a complex scheduling problem of an assembly company, in which there are several objective functions and several constraints that must be satisfied. The problem can be addressed as a multi-mode resource constrained project scheduling problem. One important feature of the problem at hand is that workers have different work profiles, which allows different modes of action in which the various tasks can be carried out. In addition, tasks must follow certain precedence relation for their execution and there are certain specific tasks that cannot be executed in parallel. Considering that the company needs to fulfill several objectives, this project aims to solve a multi-objective and multi-mode resource constrained project scheduling problem in which workers with different work profiles are the main resource for performing the tasks. To address the problem, initially, the formulation of a mathematical model for solving a multi-mode and multi-objective RCPSP problem is proposed. This model was implemented using the NEOS Server tool and evaluated for various instances of the problem. On the other hand, a non-dominated sorting genetic algorithm model (NSGA-II) was designed for this type of problem using the Python programming language. Different instances were also executed within this model. Additionally, a user interface was developed to facilitate the use of the programming model. This interface was constructed using Visual Studio and allows the user to obtain solutions within the Pareto frontier and visualize them through a three-dimensional graph and a Gantt chart. Finally, different metrics were calculated to evaluate the quality of the formation of the Pareto frontiers, such as number of Pareto solutions, spacing, diversity and mean ideal distance. Based on the above, it is evident that the NSGA-II tool is versatile for decision-making and problem-solving across various applications. Specifically, this was confirmed with the assembly company, where its objective function was reduced by 9.05%.

• Autores: Barrera Caro, Sara Sofía; Ossa Ahumada, Juan David; Terreros Romero, Oscar Andres; Jaque Saza, Brenda Sofia
• Tipo de recurso: Trabajo de grado de pregrado
• Fecha de publicación: 2023
• Institución: Pontificia Universidad Javeriana
• Repositorio: Repositorio Universidad Javeriana
• Idioma: spa
• OAI Identifier: oai:repository.javeriana.edu.co:10554/67114
• Acceso en línea: http://hdl.handle.net/10554/67114
• Palabra clave: Problema de programación de proyectos con recursos limitados; Multi objetivo; Multi modo; Algoritmo genético de ordenamiento no-dominado II; Empresa de ensamblaje; Modelo matemático; Interfaz; Resource Constrained Project Scheduling Problem (RCPSP); Multi-objective; Multi-mode; Non-dominated sorting genetic algorithm (NSGA-II); assembly company; mathematical model; interface.; Ingeniería industrial - Tesis y disertaciones académicas; Modelos matemáticos
• Rights: openAccess
• License: Atribución-NoComercial-SinDerivadas 4.0 Internacional