Estudio del problema de diseño de turnos y cómo resolverlo

Abstract

En este trabajo vamos a describir en qué consiste el problema de diseño de turnos y expondremos tres técnicas para resolver este problema: la programación lineal entera multiobjetivo, el método de restricciones ε y los métodos heurísticos.Todos estos métodos, se utilizan para tratar de obtener la solución óptima, o al menos, una aproximación a la misma. Para ello, hemos considerado un conjunto de restricciones de carácter general, que habitualmente se incluyen en este tipo de problemas y que son ampliamente tratadas en la literatura. Finalmente, compararemos los resultados obtenidos con distintos solvers: Xpress Optimizer, Gurobi y Cplex utilizando métodos de programación linealentera multiobjetivo.

In this work, we are going to describe what the shift design problem consists of and we will study three techniques for solving this problem: the multiobjective integer linear programming, the ε constraint method, and heuristic methods. We will not implement the latter, since their study is very extensive and would require a deeper analysis. All of these methods are used to try to obtain the optimal solution, or at least, an approximation to it. To do this, we have considered a set of general constraints, which are usually included in this type of problem and they are widely discussed in the literature (Dantzig (3) and Kocabas (6)). Finally, we will compare the results obtained with different solvers: Xpress Optimizer, Gurobi and Cplex using multiobjective integer linear programming methods.