IMPLEMENTASI ALGORITMA PATTERN GENERATION DALAM PEMBENTUKAN MODEL GILMORE AND GOMORY PADA MULTIPLE STOCK SIZE CUTTING STOCK PROBLEM DUA DIMENSI

ANANDA, VINNY and Octarina, Sisca and Yuliza, Evi (2018) IMPLEMENTASI ALGORITMA PATTERN GENERATION DALAM PEMBENTUKAN MODEL GILMORE AND GOMORY PADA MULTIPLE STOCK SIZE CUTTING STOCK PROBLEM DUA DIMENSI. Undergraduate thesis, Sriwijaya University.

	Text RAMA_44201_08011281419025_0003098401_0027077805_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (1MB)
	Text RAMA_44201_08011281419025_0003098401_0027077805_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (801kB) | Request a copy
	Text RAMA_44201_08011281419025_0003098401_0027077805_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (369kB) | Request a copy
	Text RAMA_44201_08011281419025_0003098401_0027077805_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (4MB) | Request a copy
	Text RAMA_44201_08011281419025_0003098401_0027077805_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (258kB) | Request a copy
	Text RAMA_44201_08011281419025_0003098401_0027077805_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (263kB) | Request a copy
	Text RAMA_44201_08011281419025_0003098401_0027077805_07_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (345kB) | Request a copy

Abstract

Two-dimensional Multiple Stock Size Cutting Stock Problem (MSSCSP) is an optimization problem in determining the most optimal cutting pattern of materials with length and width variables. The optimal cutting pattern is needed to minimize the amount of materials used. This research implemented the pattern generation algorithm to generate Gilmore and Gomory models on every variation of material sizes. The algorithm generated 63 patterns, 29 patterns, and 14 patterns which correspond to materials with a length of 24 inches, 18 inches, and 13 inches. As for the 14 inches, 13 inches, and 10 inches long material variations the algorithm generated 70 patterns, 57 patterns, and 29 patterns respectively. Then, Gilmore and Gomory models were generated according to the size of the material, where the Gilmore and Gomory model constraints ensured that strips cut in the first stage cutting were used in the second stage cutting and met all product requirements. The Branch and Bound method was then used to determine the minimum size of the material sheets needed, which were 1 sheet of 24 inches × 14 inches and 24 inches × 13 inches, 2 sheets of 18 inches × 10 inches, and 3 sheets of 13 inches × 10 inches.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Multiple Stock Size Cutting Stock Problem, Pattern Generation, Gilmore and Gomory, Branch and Bound.
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA101-(145) Elementary mathematics. Arithmetic
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	22 Jul 2019 02:58
Last Modified:	22 Jul 2019 05:45
URI:	http://repository.unsri.ac.id/id/eprint/507

Actions (login required)

View Item