A Mixed-Integer Linear Programming Model for the Cutting Stock Problem in the Steel Industry

Daniel Morillo-Torres, Mauricio Torres Baena, John Wilmer Escobar, Alfonso R. Romero-Conrado, Jairo R. Coronado-Hernández, Gustavo Gatica

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

3 Citas (Scopus)

Resumen

A mixed-integer linear programming (MILP) model is proposed for solving a one dimension cutting stock problem (1D-CSP) in the steel industry. A case study of a metallurgical company is presented and the objective is to minimize waste in the cutting process of steel bars, considering inventory constraints and the potential use of the resulting leftovers. The computational results showed that an optimal solution was always found with an average improvement in waste reduction of 80 %. There was no significant difference when comparing results between the complete model and the model without inventory constraints.

Idioma originalInglés
Título de la publicación alojadaApplied Computer Sciences in Engineering - 8th Workshop on Engineering Applications, WEA 2021, Proceedings
EditoresJuan Carlos Figueroa-García, Yesid Díaz-Gutierrez, Elvis Eduardo Gaona-García, Alvaro David Orjuela-Cañón
EditorialSpringer Science and Business Media Deutschland GmbH
Páginas315-326
Número de páginas12
ISBN (versión impresa)9783030867010
DOI
EstadoPublicada - 2021
Evento8th Workshop on Engineering Applications, WEA 2021 - Virtual, Online
Duración: 06 oct. 202108 oct. 2021

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen1431 CCIS
ISSN (versión impresa)1865-0929
ISSN (versión digital)1865-0937

Conferencia

Conferencia8th Workshop on Engineering Applications, WEA 2021
CiudadVirtual, Online
Período06/10/2108/10/21

Huella

Profundice en los temas de investigación de 'A Mixed-Integer Linear Programming Model for the Cutting Stock Problem in the Steel Industry'. En conjunto forman una huella única.

Citar esto