New formulations for the minimization open stacks problems and related

Abstract

In this project, we address the Minimization of Open Stacks Problem (MOSP). This problem arises in the context of manufacturing systems in which objects are cut to produce items in the face of cutting patterns. When the production of an item type begins, a stack is opened, and it is closed only after the production of the last copy of the corresponding item type. The MOSP consists of sequencing the cutting patterns in order to minimize the number of open stacks, and thus indirectly reduce the costs of production, labor and machinery. In this new study, we propose to develop a new formulation for the MOSP based on a multi-commodity flow problem with additional constraints. To the best of our knowledge, there is no related work in the literature. We believe that this formulation can be developed, and that it is capable of generating stronger lower bounds compared to the models already existing in the literature, as well as solving larger problem instances. (AU)