AccScience Publishing / IJOCTA / Online First / DOI: 10.36922/ijocta.1660
RESEARCH ARTICLE

A MILP model for one dimensional cutting stock problem with adjustable leftover threshold and cutting cost

Anett Rácz*
Show Less
1 Department of Applied Mathematics and Probability Theory, University of Debrecen, Hungary
Submitted: 6 August 2024 | Accepted: 15 January 2025 | Published: 19 March 2025
© 2025 by the Author(s). This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution -Noncommercial 4.0 International License (CC-by the license) ( https://creativecommons.org/licenses/by-nc/4.0/ )
Abstract

This paper presents a MILP model for one dimensional cutting stock (CSP) problems that considers the most commonly used objectives all together. These are the minimization of the trim loss which is the leftover that is not large enough to be reused in the future, minimization of the total cutting cost and number of bars involved. We carried out computational experiments in order to find out the limitations of our model and to compare it with the most commom linear cutting software on the market.

Keywords
One dimensional cutting stock problem
Mixed-integer linear-programming
Optimization
Funding
None.
Conflict of interest
The author declare that they have no conflict of interest regarding the publication of this article.
References
  1. Joshi AV. Optimization of flexo process parameters to reduce the overall manufacturing cost. An International Journal of Optimization and Control: Theories & Applications (IJOCTA). 2022;12(1):66-78. https://doi.org/10.11121/ijocta.2022.1137

 

  1. Ku¨cu¨kkoc I. Scheduling of distributed additive manufacturing machines considering carbon emissions. An International Journal of Optimization and Control: Theories & Applications (IJOCTA). 2023;14(1):20-31. https://doi.org/10.11121/ijocta.1444

 

  1. Berk J. Cost reduction and optimization for manufacturing and industrial companies. John Wiley & Sons.2010; https://doi.org/10.1002/9780470643815

 

  1. Kantorovich LV. Mathematical methods of organizing and planning production. Manag Sci. 1960;6(4):366-422. https://doi.org/10.1287/mnsc.6.4.366

 

  1. Cherri AC, Arenales MN, Yanasse HH. The one- dimensional cutting stock problem with usable leftover-A heuristic approach. Eur J Oper Res. 2009;196(3):897-908. https://doi.org/10.1016/j.ejor.2008.04.039

 

  1. Abuabara A, Morabito R. Cutting optimization of structural tubes to build agricultural light air- crafts. Ann Oper Res. 2009;169:149-165. https://doi.org/10.1007/s10479-008-0438-7

 

  1. Trkman P, Gradisar M. One-dimensional cutting stock optimization in consecutive time periods. Eur J Oper Res. 2007;179(2):291-301. https://doi.org/10.1016/j.ejor.2006.03.027

 

  1. Gradisar M, Jesenko J, Resinovic G. Optimization of roll cutting in clothing industry. Comput Oper Res. 1997;24(10):945-953. https://doi.org/10.1016/S0305-0548(97)00005-1

 

  1. Sinuany-Stern Z, Weiner I. The one dimensional cutting stock problem using two objectives. J Oper Res Soc. 1994;45:231-236. https://doi.org/10.1057/jors.1994.28

 

  1. Rahimi, Z., & Maghrebi M. Minimizing rebar cost using design and construction integration. Autom Constr. 2023;147:104701. https://doi.org/10.1016/j.autcon.2022.104701

 

  1. Erjavec J, Gradisar M, Trkman P. Assessment of stock size to minimize cutting stock production costs. Int J Prod Econ. 2012;135(1):170-176. https://doi.org/10.1016/j.ijpe.2010.10.001

 

  1. Tanir D, Ugurlu O, Guler A, Nuriyev U. One- dimensional cutting stock problem with divisible items: A case study in steel industry. TWMS J of Apl & Eng Math. 2019;9(3):473-484.

 

  1. Winston W. Operations Research: Applications and Algorithm. (Thomson Learning, Inc.) 2004.

 

  1. Pyomo [online]. Available from: https://www.py omo.org/ [Accessed 22 January 2024].

 

  1. Gurobi optimization. [online]. Available from: https://www.gurobi.com/ [Accessed 22 January 2024].

 

  1. Keyword Research Tool 2.0 [online]. Available from: https://www.keyword-tools.org/ [Accessed 22 January 2024].

 

  1. Google Rank Checker [online]. Available from: [Accessed 22 January 2024].

 

  1. Devtica s.r.o. OptiCutter tutorial [online]. Avail- able from: https://www.opticutter.com/lin ear-cut-list-calculator [Accessed 22 Janu- ary 2024].

 

  1. 1D-Solutions 1D-Solutions tutorial [online]. Available from: https://www.1d-solutions.c om/product.html [Accessed 22 January 2024].

 

  1. Optimalon Software Ltd. Optimalon tutorial [online]. Available from: h t t p s ://www.optimalon.com/products.htm [Accessed 22 January 2024].
Share
Back to top
An International Journal of Optimization and Control: Theories & Applications, Electronic ISSN: 2146-5703 Print ISSN: 2146-0957, Published by AccScience Publishing