Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
In this paper, we study the one-dimensional multi-period cutting stock problem with setup costs on cutting patterns. We present pattern-based and pseudo-polynomial formulations for the problem. Reformulations are also proposed to improve the lower bounds. We then present a thorough theoretical analy...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2023 |
| País: | Brasil |
| Institución: | Universidade Estadual Paulista (UNESP) |
| Repositorio: | Repositório Institucional da UNESP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.unesp.br:11449/245879 |
| Acceso en línea: | http://dx.doi.org/10.1016/j.ejor.2022.04.023 http://hdl.handle.net/11449/245879 |
| Access Level: | acceso abierto |
| Palabra clave: | Combinatorial optimization Cutting Cutting pattern setups Strong reformulations |
| Sumario: | In this paper, we study the one-dimensional multi-period cutting stock problem with setup costs on cutting patterns. We present pattern-based and pseudo-polynomial formulations for the problem. Reformulations are also proposed to improve the lower bounds. We then present a thorough theoretical analysis to establish the strength of the various proposed formulations in comparison to each other. Finally, a computational analysis is conducted to complement the theoretical analysis and provide further insights with respect to the complexity and strength of the formulations. |
|---|