IMPLEMENTASI MODEL GILMORE AND GOMORY DAN MODIFIED BRANCH AND BOUND ALGORITHM PADA PENYELESAIAN CUTTING STOCK PROBLEM (CSP)
| ctrlnum |
6749 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><relation>http://repository.unsri.ac.id/6749/</relation><title>IMPLEMENTASI MODEL GILMORE AND GOMORY DAN MODIFIED BRANCH AND BOUND ALGORITHM PADA PENYELESAIAN CUTTING STOCK PROBLEM (CSP)</title><creator>WULANDARI, PUTRI CAHYA</creator><creator>Octarina, Sisca</creator><creator>Yahdin, Sugandi</creator><subject>QA1-939 Mathematics</subject><subject>QA37.3.1.64 Applied Mathematics</subject><description>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.</description><date>2018-03-18</date><type>Thesis:Thesis</type><type>PeerReview:NonPeerReviewed</type><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/1/RAMA_44201_08011181320017_0003098401_0027075803_01_front_ref.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/2/RAMA_44201_08011181320017_0003098401_0027075803_02.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/3/RAMA_44201_08011181320017_0003098401_0027075803_03.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/4/RAMA_44201_08011181320017_0003098401_0027075803_04.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/5/RAMA_44201_08011181320017_0003098401_0027075803_05.pdf</identifier><type>Book:Book</type><language>ind</language><rights>cc_public_domain</rights><identifier>http://repository.unsri.ac.id/6749/6/RAMA_44201_08011181320017_0003098401_0027075803_06_ref.pdf</identifier><identifier> 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. </identifier><recordID>6749</recordID></dc>
|
| language |
ind |
| format |
Thesis:Thesis Thesis PeerReview:NonPeerReviewed PeerReview Book:Book Book |
| author |
WULANDARI, PUTRI CAHYA Octarina, Sisca Yahdin, Sugandi |
| title |
IMPLEMENTASI MODEL GILMORE AND GOMORY DAN MODIFIED BRANCH AND BOUND ALGORITHM PADA PENYELESAIAN CUTTING STOCK PROBLEM (CSP) |
| publishDate |
2018 |
| isbn |
0801118132001 |
| topic |
QA1-939 Mathematics QA37.3.1.64 Applied Mathematics |
| url |
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/ |
| contents |
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. |
| id |
IOS8119.6749 |
| institution |
Universitas Sriwijaya |
| institution_id |
177 |
| institution_type |
library:university library |
| library |
UPT Perpustakaan Universitas Sriwijaya |
| library_id |
1098 |
| collection |
Sriwijaya University Institutional Repository |
| repository_id |
8119 |
| city |
OGAN ILIR |
| province |
SUMATERA SELATAN |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS8119 |
| first_indexed |
2020-03-23T07:56:09Z |
| last_indexed |
2020-03-23T07:56:09Z |
| recordtype |
dc |
| _version_ |
1674860797839278080 |
| score |
17.60899 |