Valid inequalities for the bounded-interval with multiple resources generalized assignment problem
Ponente(s): Nestor Miguel Cid Garcia, Dr. Jonás Velasco; Mtro. Víctor Macedo
In this talk, we present a set of valid inequalities for the bounded-interval with multiple resources generalized assignment problem (BIMRGAP). This problem belongs to the category of the generalized assignment problem, which has more than one resource, and the agents have to develop at least some tasks without exceeding their capabilities. The objective function for this problem has two terms to minimize: 1) the sum of the costs for each agent to do the assigned tasks, and 2) the linear term of minimizing the sum of costs that each pair of tasks generates if an agent is assigned both tasks. In terms of the real problem, we change the perspective of the classical assignment problem; we consider minimizing distances instead of costs and centers-families assignments instead of agents-tasks assignments. Experimental results based on real-life instances show the quality of the solutions and present a comparison with other methodologies of the literature.