BAREKENG: Jurnal Ilmu Matematika dan Terapan
Vol 16 No 3 (2022): BAREKENG: Journal of Mathematics and Its Applications

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

Bib Paruhum Silalahi (Department of Mathematics, Faculty of Mathematics and Natural Sciences, IPB University)
Farida Hanum (Department of Mathematics, Faculty of Mathematics and Natural Sciences, IPB University)
Fajar Setyawan (Department of Mathematics, Faculty of Mathematics and Natural Sciences, IPB University)
Prapto Tri Supriyo (Department of Mathematics, Faculty of Mathematics and Natural Sciences, IPB University)



Article Info

Publish Date
01 Sep 2022

Abstract

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.

Copyrights © 2022






Journal Info

Abbrev

barekeng

Publisher

Subject

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

Description

BAREKENG: Jurnal ilmu Matematika dan Terapan is one of the scientific publication media, which publish the article related to the result of research or study in the field of Pure Mathematics and Applied Mathematics. Focus and scope of BAREKENG: Jurnal ilmu Matematika dan Terapan, as follows: - Pure ...