Abstract
The paper describes models for scheduling the patterns that form a solution of a cutting stock problem. We highlight the problem of providing the required final products with the necessary items obtained from the cut, choosing which pattern feeds which lot of parts. This problem can be solved prior to schedule cuts, or in an integrated way. We present integer programming models for both approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arbib, C., Marinelli, F.: On cutting stock with due dates. Omega Int. J. Manag. Sci. 46, 11–20 (2014)
Arbib, C., Marinelli, F.: Maximum lateness minimization in one-dimensional bin packing. Omega Int. J. Manag. Sci. 68, 76–84 (2017)
Arbib, C., Felici, G., Servilio, M.: Sorting common operations to minimize the number of tardy jobs. Networks 64(4), 306–320 (2014)
Arbib, C., Marinelli, F., Ventura, P.: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model. Int. Trans. Oper. Res. 23(1–2), 47–63 (2016)
Belov, G., Scheithauer, G.: Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS J. Comput. 19(1), 27–35 (2007)
Gramani, M.C.N., Franca, P.M., Arenales, M.N.: A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem. Int. J. Prod. Econ. 119, 219–227 (2009)
Russo, M., Sforza, A., Sterle, C.: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems. Comput. Oper. Res. 50, 97–114 (2014)
Smith, B.M., Gent, I.P.: Constraint modelling challenge 2005. In: Fifth Workshop on Modelling and Solving Problems with Constraints, IJCAI 2005, Edinburgh, Scotland, 31 July 2005
Acknowledgements
Work supported by the Italian Ministry of Education, National Research Program (PRIN) 2015, contract no. 20153TXRX9.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Arbib, C., Avella, P., Boccia, M., Marinelli, F., Mattia, S. (2017). Optimization Models for Cut Sequencing. In: Sforza, A., Sterle, C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-67308-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-67308-0_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67307-3
Online ISBN: 978-3-319-67308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)