Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks

We address three variants of the two-dimensional cutting stock problem in which the guillotine cutting of large objects produces a set of demanded items. The characteristics of the variants are: the rectangular shape of the objects and items; the number of two or three orthogonal guillotine stages; and, a sequencing constraint that limits the number … Read more

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

The One-Dimensional Cutting Stock Problem with Setup Cost (CSP-S) is a cutting problem that seeks a cutting plan with a minimum number of objects and a minimum number of different patterns. This problem gains relevance in manufacturing settings, where time consuming operations to set up the knives of the cutting machine for the new patterns … Read more

Mathematical models for the minimization of open stacks problem

In this paper, we address the Minimization of Open Stacks Problem (MOSP). This problem often appears during production planning of manufacturing industries, such as in the cutting of objects to comply with space constraints around the cutting machine in the glass, furniture, and metallurgical industries. The MOSP is also pertinent to the field of VLSI … Read more

A support tool for planning classrooms considering social distancing between students

In this paper, we present the online tool salaplanejada.unifesp.br developed to assist the layout planning of classrooms considering the social distance in the context of the COVID-19 pandemic. We address both the allocation problem in rooms where seats are fixed as well as the problem in rooms where seats can be moved freely. For the … Read more