IMPLEMENTASI MODEL GILMORE AND GOMORY DAN MODIFIED BRANCH AND BOUND ALGORITHM PADA PENYELESAIAN CUTTING STOCK PROBLEM (CSP)

WULANDARI, PUTRI CAHYA and Octarina, Sisca and Yahdin, Sugandi (2018) IMPLEMENTASI MODEL GILMORE AND GOMORY DAN MODIFIED BRANCH AND BOUND ALGORITHM PADA PENYELESAIAN CUTTING STOCK PROBLEM (CSP). Undergraduate thesis, Sriwijaya University.

Preview	Text RAMA_44201_08011181320017_0003098401_0027075803_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (614kB) | Preview
	Text RAMA_44201_08011181320017_0003098401_0027075803_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (190kB) | Request a copy
	Text RAMA_44201_08011181320017_0003098401_0027075803_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (158kB) | Request a copy
	Text RAMA_44201_08011181320017_0003098401_0027075803_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (866kB) | Request a copy
	Text RAMA_44201_08011181320017_0003098401_0027075803_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (92kB) | Request a copy
	Text RAMA_44201_08011181320017_0003098401_0027075803_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (181kB) | Request a copy

Abstract

Cutting Stock Problem (CSP) is a problem in determining the cutting pattern from a set of stock with standard length and width to fulfill the demand of items. This research implemented pattern generation algorithm to formulate Gilmore and Gomory model of two dimensional CSP. There were 6 and 12 cutting patterns which selected, respectively associated to the length and width edge, that had been formulated in Gilmore and Gomory model. The constraints of Gilmore and Gomory model was performed to assure the strips which cut in first stage will be used in the second stage and fulfill the demand of items. While the model of Modified Branch and Bound Algorithm which completed using Branch and Bound method yielded 20 patterns.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Cutting Stock Problem, Pattern Generation, Gilmore and Gomory, Branch and Bound
Subjects:	Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA1-939 Mathematics > QA37.3.1.64 Applied Mathematics
Divisions:	08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User:	Mrs Kharisma Afrianti
Date Deposited:	09 Sep 2019 07:48
Last Modified:	09 Sep 2019 07:48
URI:	http://repository.unsri.ac.id/id/eprint/6749

Actions (login required)

View Item