Optimalizácia rezania hutného materiálu
Keywords:
optimálne rozdelenie materiálu, Python, minimalizácia strát, rezný plán, matematické programovanieAbstract
When cutting of metallurgical materials, especially metal bars, it is necessary to create a plan for optimal use of the material lengths to minimize losses of material. The material is supplied in the form of bars and some of orders are distributed checks to the material that needs to be cut. In the case of the balance of the rod, it is stored back in the warehouse. The aim of the paper is to create a methodology for optimizing the cutting of metal bars in order to minimize waste. The basic software in the spreadsheet editor MS Excel and in the Python language was also created. At the end of the article, an example of the solution of the optimal distribution of bar material for the company is given. Based on the customer's requirements and the list of available material, a cutting plan was created and the total waste was calculated. The article can serve as a basis for the creation of a data warehouse, which stores data not only on purchased materials, realized production, but also on the balances of material that can be used in further cutting. Data warehouse thereby allows a multidimensional view at cutting process management.References
[1] Ágoston, K. C. (2019). The effect of welding on the one-dimensional cutting-stock problem: The case of fixed firefighting systems in the construction industry. Adv. Oper. Res., vol. 2019, pp. 1-12.
[2] Anderson, D. R., Sweeney, D. J., Williams, T. A., Camm, J. D. & Cochran, J. J. (2018). An introduction to management science: quantitative approach. Cengage learning.
[3] Brezina, I. & Pekár, J. (2019). Úvod do operačného výskumu I. Bratislava: LetraEdu.
[4] Furini, F., Malaguti,. E. & Thomopulos, D. (2016). Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. INFORMS Journal on Computing, vol. 28, issue 4, pp. 736-75.1
[5] Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A. & Shamsi, A. (2012). Solving an one dimensionalcutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International. 8.1, pp. 1-8.
[6] Kellerer, H., Pferschy, U. & Pisinger, D. (2004). Knapsack Problems. Berlin Heidelberg: Springer-Verlag.
[7] Malaguti, E., Durán, R. M. & Toth, P. (2014). Approaches to real world two-dimensional cutting problems, Omega,Volume 47, pp. 99-115,ISSN 0305-0483,
[8] Tanir, D., Ugurlu, O., Guler, A., & Nuriyev, U. (2016). One-dimensional Cutting Stock Problem with Divisible Items. ArXiv, abs/1606.01419.
[9] Tanir, D., Ugurlu, O., Guler, A. & Nuriyev, U. (2019). One-dimensional cutting stock problem with divisible items: A case study in steel industry. TWMS J. Appl. Eng. Math. 2019, 9, 473–484.
[2] Anderson, D. R., Sweeney, D. J., Williams, T. A., Camm, J. D. & Cochran, J. J. (2018). An introduction to management science: quantitative approach. Cengage learning.
[3] Brezina, I. & Pekár, J. (2019). Úvod do operačného výskumu I. Bratislava: LetraEdu.
[4] Furini, F., Malaguti,. E. & Thomopulos, D. (2016). Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming. INFORMS Journal on Computing, vol. 28, issue 4, pp. 736-75.1
[5] Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A. & Shamsi, A. (2012). Solving an one dimensionalcutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International. 8.1, pp. 1-8.
[6] Kellerer, H., Pferschy, U. & Pisinger, D. (2004). Knapsack Problems. Berlin Heidelberg: Springer-Verlag.
[7] Malaguti, E., Durán, R. M. & Toth, P. (2014). Approaches to real world two-dimensional cutting problems, Omega,Volume 47, pp. 99-115,ISSN 0305-0483,
[8] Tanir, D., Ugurlu, O., Guler, A., & Nuriyev, U. (2016). One-dimensional Cutting Stock Problem with Divisible Items. ArXiv, abs/1606.01419.
[9] Tanir, D., Ugurlu, O., Guler, A. & Nuriyev, U. (2019). One-dimensional cutting stock problem with divisible items: A case study in steel industry. TWMS J. Appl. Eng. Math. 2019, 9, 473–484.
Downloads
Published
2021-12-17
Issue
Section
Articles
