View Item 
      •   IPB Repository
      • Dissertations and Theses
      • Undergraduate Theses
      • UT - Faculty of Mathematics and Natural Sciences
      • UT - Mathematics
      • View Item
      •   IPB Repository
      • Dissertations and Theses
      • Undergraduate Theses
      • UT - Faculty of Mathematics and Natural Sciences
      • UT - Mathematics
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Penyelesaian Cutting Stock Problem Satu Dimensi pada Pemotongan Balok Kayu Menggunakan Column Generation Technique

      Thumbnail
      View/Open
      Cover (382.3Kb)
      Fullteks (6.595Mb)
      Lampiran (335.3Kb)
      Date
      2021-09
      Author
      Ramadhan, Sheva Rezki
      Silalahi, Bib Paruhum
      Mayyani, Hidayatul
      Metadata
      Show full item record
      Abstract
      Cutting Stock Problem (CSP) satu dimensi adalah suatu permasalahan pemotongan benda yang pola pemotongannya hanya berdasarkan satu dimensi saja. Pemotongan yang dilakukan bertujuan meminimumkan sisa pemotongan yang dihasilkan. Penelitian ini akan meneliti masalah pemotongan balok kayu di UD Sinar Jaya Abadi Depok dengan tujuan mendapatkan kombinasi pola pemotongan optimal yang meminimumkan sisa hasil pemotongan balok kayu. Pada penelitian ini, digunakan column generation technique (CGT) dengan bantuan algoritma pattern generation. Pada tahap pertama, algoritma pattern generation digunakan untuk menentukan seluruh pola pemotongan yang layak. Selanjutnya CGT digunakan untuk mencari kombinasi pola pemotongan. Hasil yang diperoleh untuk meminimumkan sisa pemotongan balok kayu di UD Sinar Jaya Abadi Depok dapat dilakukan dengan memotong 2,5 meter panjang balok kayu sebanyak 190 batang dengan kombinasi pola pemotongan yang optimal yaitu kombinasi pola 1 sebanyak 50 batang, pola 6 sebanyak 20 batang, pola 12 sebanyak 80 batang, pola 26 sebanyak 30 batang, dan pola 38 sebanyak 10 batang.
       
      One-dimensional cutting stock problem (CSP) is a cutting problem whose cutting pattern is based only on one dimension. This cutting aims to minimize the trim loss from the cuts. This study will examine the problem of timber cutting at UD Sinar Jaya Abadi Depok to obtain the optimal combination of cutting patterns that minimize the remaining results of timber cutting. In this research column generation technique is used with pattern generation algorithm help. In the first stage, the pattern generation algorithm is used to determine all the feasible cutting patterns. Next, CGT is used to find a combination of cutting patterns that can minimize trim loss. The result obtained to minimized the trim loss of timber cutting at UD Sinar Jaya Abadi Depok has done by cutting a 2,5 meters timber of 190 sticks with the optimal combination of cutting patterns, namely a combination of pattern 1 as many as 50 sticks, pattern 6 as many as 20 sticks, pattern 12 as many as 80 sticks, pattern 26 as many as 30 sticks, and pattern 38 as many as 10 stickies.
       
      URI
      http://repository.ipb.ac.id/handle/123456789/109390
      Collections
      • UT - Mathematics [1487]

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository
        

       

      Browse

      All of IPB RepositoryCollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

      My Account

      Login

      Application

      google store

      Copyright © 2020 Library of IPB University
      All rights reserved
      Contact Us | Send Feedback
      Indonesia DSpace Group 
      IPB University Scientific Repository
      UIN Syarif Hidayatullah Institutional Repository
      Universitas Jember Digital Repository