Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 16 No. 3 (2022) · hlm. 805–814

DOI
10.30598/barekengvol16iss3pp805-814
ISSN
2615-3017, 1978-7227
Terbit
2022-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Cutting stock problem (CSP) is a problem of cutting an object into several smaller objects to fulfill the existing demand with a minimum unused object remaining. Besides minimizing the remaining of the object, sometimes there is another additional problem in CSP, namely minimizing the number of different cutting patterns. This happens because there is a setup cost for each pattern. This study shows a way to obtain a minimum number of different patterns in the cutting stock problem (CSP). An example problem is modeled in linear programming and then solved by a column generation algorithm using the Lingo 18.0 software.

Jaringan kolaborasi para penulis

22 penulis · 46 tautan kepenulisan bersama · 6 lintas organisasi

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

  • IPB University
  • University of National Education
  • Universitas Bina Sarana Informatika
  • 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
Hidayatul MayyaniIPB University2
Yeni HerdiyeniIPB University1
Ngakan Nyoman Kutha KrisnawijayaUniversity of National Education1
Silviana Eka PertiwiIPB University1
Nur AliatiningtyasIPB University1
Ulil Albab Mu'minIPB University1
Sugi GuritmanIPB University1
Amril AmanIPB University1
Siti AminahIPB University1
Toni BakhtiarIPB University1
Jaharuddin JaharuddinIPB University1
Amril AmanAfiliasi tidak diketahui1
Prapto Tri SupriyoAfiliasi tidak diketahui1
Vina Izza NurikaAfiliasi tidak diketahui1
Karlisa PriandanaIPB University1
Agus BuonoIPB University1
Sumanto SumantoUniversitas Bina Sarana Informatika1
Elisabeth Sri HendrastutiIPB University1

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 15 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">ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS</dc:title>
	<dc:creator>Silalahi, Bib Paruhum</dc:creator>
	<dc:creator>Hanum, Farida</dc:creator>
	<dc:creator>Setyawan, Fajar</dc:creator>
	<dc:creator>Supriyo, Prapto Tri</dc:creator>
	<dc:description xml:lang="en-US">Cutting stock problem (CSP) is a problem of cutting an object into several smaller objects to fulfill the existing demand with a minimum unused object remaining. Besides minimizing the remaining of the object, sometimes there is another additional problem in CSP, namely minimizing the number of different cutting patterns. This happens because there is a setup cost for each pattern. This study shows a way to obtain a minimum number of different patterns in the cutting stock problem (CSP). An example problem is modeled in linear programming and then solved by a column generation algorithm using the Lingo 18.0 software.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2022-09-01</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/5442</dc:identifier>
	<dc:identifier>10.30598/barekengvol16iss3pp805-814</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 16 No 3 (2022): BAREKENG: Journal of Mathematics and Its Applications; 805-814</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol16iss3year2022</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5442/4598</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Bib Paruhum Silalahi, Farida Hanum, Fajar Setyawan, Prapto Tri Supriyo</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>