Maria do Socorro Nogueira Rangel, IBILCE/UNESP
The decisions associated with the cutting stock problem (CSP) are usually taken considering a set of conflicting objectives and, in general, there is not a single solution that attends all of them. An example is the definition of a cutting plan that minimizes the total waste and maximize the cutting machine productivity. The literature on multiobjective combinatorial optimization is quite extensive, however, only a few papers address the multiobjective CSP. In this work we present mathematical models and a biobjective computational study of the CSP taking into account the minimization of waste and the possibility of cutting several objects simultaneously (maximizing the productivity of the cutting machine).