Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

SOLVING CUTTING STOCK PROBLEM USING PATTERN GENERATION METHOD ON 2-DIMENSIONAL STOCK

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 1 (2025) · hlm. 303–318

DOI
10.30598/barekengvol19iss1pp303-318
ISSN
2615-3017, 1978-7227
Terbit
2025-01-13
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This article discusses the solution of the 2-dimensional stock cutting problem using the Branch and Bound modified pattern generation method. The pattern generation method will produce a feasible cutting pattern matrix which is then converted into a mathematical model with a linear program equation with an objective function to minimize the use of initial stock materials. The research is a case study located at the Handal Karya Buana Store which is engaged in cutting glass of different sizes, thicknesses and types of glass. In this case, 3 types of initial stock will be used with the same thickness, and type but have different area sizes, and one of the consumer demand data will be used, namely 3 types of requests with different sizes and many requests. By using the pattern generator method, 10 cutting patterns are generated with each different cutting residue. By using the simplex method, the optimal solution is obtained for the amount of initial stock needed, the pattern used and the remaining cuts produced. So using the pattern generator method can produce a feasible cutting pattern, and can be used as an alternative to solve the stock cutting problem.

Jaringan kolaborasi para penulis

40 penulis · 178 tautan kepenulisan bersama · 17 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Halu Oleo
  • Riau University
  • University of Palangka Raya
  • Universitas Islam Negeri Alauddin Makassar
  • Hasanuddin University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Muhammad BotekUniversitas Halu Oleo6
Andi KhaeruniUniversitas Halu Oleo5
Abdul M. BalubiAfiliasi tidak diketahui5
Irwan J. EffendyAfiliasi tidak diketahui5
TERRY PAKKIUniversitas Halu Oleo4
Waode Siti Anima HiseinUniversitas Halu Oleo3
NUR ISNAINI ULFAUniversitas Halu Oleo3
AGUNG YUSWANAUniversitas Halu Oleo3
Agus KurniaAfiliasi tidak diketahui3
Hasriati HasriatiRiau University3
Akhmad MansyurUniversitas Halu Oleo2
Asniah AsniahUniversitas Halu Oleo2
ASNIAH ASNIAHAfiliasi tidak diketahui2
MARIADI MARIADIUniversitas Halu Oleo2
MUHAMMAD TAUFIKUniversitas Halu Oleo2
Rahmat S. PatadjaiAfiliasi tidak diketahui2
Halim HalimUniversitas Halu Oleo1
La Ode Santiaji BandeUniversitas Halu Oleo1
Asdianti AsdiantiUniversitas Halu Oleo1
Hasriani HasrianiUniversitas Islam Negeri Alauddin Makassar1
NURIADI NURIADIUniversitas Halu Oleo1
WAODE SITI ANIMA HISEINAfiliasi tidak diketahui1
GUSNAWATY HSAfiliasi tidak diketahui1
MIRZA ARSIATY ARSYADUniversitas Halu Oleo1
Murni Sari RahayuUniversitas Halu Oleo1
Nurhidayah NurhidayahHasanuddin University1
RISDAYANI RISDAYANIUniversitas Halu Oleo1
Asrianti AsriantiAfiliasi tidak diketahui1
Lita Oktafiana HuttniUniversitas Halu Oleo1
Vit Neru SatrahUniversitas Halu Oleo1
RANI AYUNIAfiliasi tidak diketahui1
NOVITA PRAMASARI PUTRIAfiliasi tidak diketahui1
Syair SyairAfiliasi tidak diketahui1
Andi NurmasUniversitas Halu Oleo1
NOFIANTI -Afiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">SOLVING CUTTING STOCK PROBLEM USING PATTERN GENERATION METHOD ON 2-DIMENSIONAL STOCK</dc:title>
	<dc:creator>Hasbiyati, Ihda</dc:creator>
	<dc:creator>Latifa, Indri</dc:creator>
	<dc:creator>Rahman, Abdul</dc:creator>
	<dc:creator>Ahriyati, Ahriyati</dc:creator>
	<dc:creator>Gamal, Moh Danil Hendry</dc:creator>
	<dc:description xml:lang="en-US">This article discusses the solution of the 2-dimensional stock cutting problem using the Branch and Bound modified pattern generation method. The pattern generation method will produce a feasible cutting pattern matrix which is then converted into a mathematical model with a linear program equation with an objective function to minimize the use of initial stock materials. The research is a case study located at the Handal Karya Buana Store which is engaged in cutting glass of different sizes, thicknesses and types of glass. In this case, 3 types of initial stock will be used with the same thickness, and type but have different area sizes, and one of the consumer demand data will be used, namely 3 types of requests with different sizes and many requests. By using the pattern generator method, 10 cutting patterns are generated with each different cutting residue. By using the simplex method, the optimal solution is obtained for the amount of initial stock needed, the pattern used and the remaining cuts produced. So using the pattern generator method can produce a feasible cutting pattern, and can be used as an alternative to solve the stock cutting problem.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-01-13</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13500</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss1pp303-318</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 1 (2025): BAREKENG: Journal of Mathematics and Its Application; 303-318</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss1year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13500/9579</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Ihda Hasbiyati, Indri Latifa, Abdul Rahman, Ahriyati Ahriyati, Moh Danil Hendry Gamal</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>