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

Main Authors:	WULANDARI, PUTRI CAHYA, Octarina, Sisca, Yahdin, Sugandi
Format:	Thesis NonPeerReviewed Book
Bahasa:	ind
Terbitan:	, 2018
Subjects:	QA1-939 Mathematics QA37.3.1.64 Applied Mathematics
Online Access:	http://repository.unsri.ac.id/6749/1/RAMA_44201_08011181320017_0003098401_0027075803_01_front_ref.pdf http://repository.unsri.ac.id/6749/2/RAMA_44201_08011181320017_0003098401_0027075803_02.pdf http://repository.unsri.ac.id/6749/3/RAMA_44201_08011181320017_0003098401_0027075803_03.pdf http://repository.unsri.ac.id/6749/4/RAMA_44201_08011181320017_0003098401_0027075803_04.pdf http://repository.unsri.ac.id/6749/5/RAMA_44201_08011181320017_0003098401_0027075803_05.pdf http://repository.unsri.ac.id/6749/6/RAMA_44201_08011181320017_0003098401_0027075803_06_ref.pdf http://repository.unsri.ac.id/6749/

Daftar Isi:

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.