On formulations for the one-dimensional cutting stock with a limited number of open stacks problem
Open Access
- 6 October 2025
- journal article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 64 (4) , 1358-1385
Abstract
No abstract availableFunding Information
- São Paulo Research Foundation (2022/05803-3)
- National Council for Scientific and Technological Development (408722/2023-1, 402492/2025-0)
This publication has 58 references indexed in Scilit:
- Mathematical models for the one-dimensional cutting stock problem with setups and open stacksJournal of Combinatorial Optimization, 2025
- Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setupsFlexible Services and Manufacturing Journal, 2022
- Exact solution of network flow models with strong relaxationsMathematical Programming, 2022
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous ordersTOP, 2019
- Modeling and solving for bi-objective cutting parallel machine scheduling problemAnnals of Operations Research, 2019
- Bin Packing Problems with Variable Pattern Processing Times: A Proof-of-conceptSpringer Proceedings in Mathematics & Statistics, 2017
- Exact Solution of Combined Cutting Stock and Scheduling Problems2016
- Improved heuristics for sequencing cutting patternsEuropean Journal of Operational Research, 1995
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problemEuropean Journal of Operational Research, 1995
- Heuristics for sequencing cutting patternsEuropean Journal of Operational Research, 1991