Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorTanır, Denizen_US
dc.contributor.authorUğurlu, Onuren_US
dc.contributor.authorGüler, Aslıen_US
dc.contributor.authorNuriyev, Urfaten_US
dc.date.accessioned2020-10-27T11:27:56Z
dc.date.available2020-10-27T11:27:56Z
dc.date.issued2019
dc.identifier.citationTanır, D., Uğurlu, O., Güler, A. & Nuriyev, U. (2019). One-dimensional cutting stock problem with divisible items: a case study in steel industry. TWMS Journal Of Applied And Engineering Mathematics, 9(3), 473-484.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2735
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/archive/102-vol9no3/430
dc.description.abstractThis paper considers the one-dimensional cutting stock problem (1D-CSP) with divisible items, which arises in the steel industries. While planning the steel cutting operations, each item can be divided into smaller pieces, then they can be recombined by welding. The objective is to minimize both the trim loss and the number of the welds. The problem can be seen as a natural generalization of the cutting stock problem (CSP) with skiving option [1] where recombining operation has a cost. In this paper, a mathematical model for the problem is given and a dynamic programming based heuristic algorithm is proposed in accordance with the company needs. Furthermore, a software, which is based on the proposed heuristic algorithm, is developed to use in MKA Company, and its performance is analyzed by solving real-life problems in the steel industry. The computational experiments show the efficiency of the proposed algorithm.en_US
dc.description.sponsorshipThe first and second authors gratefully acknowledge the support of TUBITAK (The Scientific and Technological Research Council of Turkey) 2211 program.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectProductionen_US
dc.subjectCutting stock problemsen_US
dc.subjectSkiving optionen_US
dc.subjectHeuristicsen_US
dc.subjectSteel industryen_US
dc.subjectColumn generationen_US
dc.subjectBin-packingen_US
dc.subjectAlgorithmen_US
dc.subjectOptimizationen_US
dc.subjectModelen_US
dc.titleOne-dimensional cutting stock problem with divisible items: a case study in steel industryen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume9
dc.identifier.issue3
dc.identifier.startpage473
dc.identifier.endpage484
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess