Octarina, Sisca and Radiana, Mutia and Bangun, Putra Bahtera Jaya Implementation of pattern generation algorithm in forming Gilmore and Gomory model for two dimensional cutting stock problem. In: 4th International Conference on Operational Research (InteriOR 2017), 21-23 Agustus 2017, Medan.
Preview |
Text
INTERIOR 2017.pdf Download (2MB) | Preview |
Abstract
Two dimensional 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. Cutting patterns were determined in order to minimize the usage of stock. This research implemented pattern generation algorithm to formulate Gilmore and Gomory model of two dimensional CSP. The constraints of Gilmore and Gomory model was performed to assure the strips which cut in the first stage will be used in the second stage. Branch and Cut method was used to obtain the optimal solution. Based on the results, it found many patterns combination, if the optimal cutting patterns which correspond to the first stage were combined with the second stage.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Subjects: | 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: | Putra Bahtera Jaya Bangun |
| Date Deposited: | 08 Sep 2022 00:54 |
| Last Modified: | 03 Jul 2024 01:40 |
| URI: | http://repository.unsri.ac.id/id/eprint/74689 |
Actions (login required)
 |
View Item |