El Instituto de Ingeniería Matemática y Computacional (IMC) los saluda atentamente y los invita al seminario que se dictará la próxima semana.
Marcos Goycoolea, Escuela de Administración UC.
Miércoles 3 de abril de 2024, 13:40 hrs. (Presencial en auditorio Edificio San Agustín; Link Zoom disponible escribiendo a Esta dirección de correo electrónico está siendo protegida contra los robots de spam. Necesita tener JavaScript habilitado para poder verlo.)
ABSTRACT
We examine a class of mixed integer linear programming problems characterized by having a large set of precedence constraints and a small number of additional, “arbitrary” side constraints. These problems, which in a way are “almost” totally unimodular, are applicable in a wide array of scheduling tasks, including the well-known Resource-Constrained Project Scheduling Problem (RCPSP). RCPSPs and their variants are known to be extremely difficult to solve in practice. Moreover, they are of particular importance in the field of mining, where the scale of the problems can involve hundreds of millions of variables, posing a challenge for standard commercial solvers.
In this talk will describe these precedence-constrained optimization problems and discuss how understanding the optimal solution structure can inform the creation of specialized linear programming techniques that are more scalable than traditional algorithms. We will also describe new classes of cutting planes to strengthen linear relaxations. Applications of these methods will be showcased, ranging from scheduling for open pit and underground mines to adapting to uncertainties and integrating environmental objectives into scheduling practices.
This is joint work with Patricio Lamas, Eduardo Moreno and Orlando Rivera.
