FORMULASI MODEL GILMORE AND GOMORY DAN IMPLEMENTASI METODE GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP) DALAM PENYELESAIAN CUTTING STOCK PROBLEM

SHOLIHATIN, AISYAH and Eliyati, Ning and Octarina, Sisca (2018) FORMULASI MODEL GILMORE AND GOMORY DAN IMPLEMENTASI METODE GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP) DALAM PENYELESAIAN CUTTING STOCK PROBLEM. Undergraduate thesis, Sriwijaya University.

	Text RAMA_44201_08011381419042_0020115903_0003098401_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (265kB)
	Text RAMA_44201_08011381419042_0020115903_0003098401_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (350kB) | Request a copy
	Text RAMA_44201_08011381419042_0020115903_0003098401_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (18kB) | Request a copy
	Text RAMA_44201_08011381419042_0020115903_0003098401_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (317kB) | Request a copy
	Text RAMA_44201_08011381419042_0020115903_0003098401_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (57kB) | Request a copy
	Text RAMA_44201_08011381419042_0020115903_0003098401_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (68kB) | Request a copy

Abstract

Cutting Stock Problem (CSP) is a problem in determining the cutting pattern from a stock size to the demand of item size, in order to minimize the stock number. The cutting patterns in this research were done by implementing pattern generation algorithm. The result of selected cutting pattern based on length and width were 11 and 22 cutting patterns, and then it were formulated into Gilmore and Gomory model. Based on the result, it used 4 pieces of stock with 4 combination of cutting patterns. The searching of maximum number cutting pattern will be done by implementing GRASP method. Based on the result, the demand for first item was not fulfilled, but for another item was fulfilled.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Cutting Stock Problem, Pattern Generation, Gilmore and Gomory, Greedy Randomized Adaptive Search Procedure
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA71-90 Instruments and machines
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Dies Meirita Sari
Date Deposited:	24 Jul 2019 02:03
Last Modified:	24 Jul 2019 02:03
URI:	http://repository.unsri.ac.id/id/eprint/626

Actions (login required)

View Item