Judul: Penyelesaian Cutting Stock Problem Satu Dimensi pada Pemotongan Balok Kayu Menggunakan Column Generation Technique
Abstrak: Cutting Stock Problem (CSP) satu dimensi adalah suatu permasalahan pemotongan benda yang pola pemotongannya hanya berdasarkan satu dimensi saja. Pemotongan yang dilakukan bertujuan meminimumkan sisa pemotongan yang dihasilkan. Penelitian ini akan meneliti masalah pemotongan balok kayu di UD Sinar Jaya Abadi Depok dengan tujuan mendapatkan kombinasi pola pemotongan optimal yang meminimumkan sisa hasil pemotongan balok kayu. Pada penelitian ini, digunakan column generation technique (CGT) dengan bantuan algoritma pattern generation. Pada tahap pertama, algoritma pattern generation digunakan untuk menentukan seluruh pola pemotongan yang layak. Selanjutnya CGT digunakan untuk mencari kombinasi pola pemotongan. Hasil yang diperoleh untuk meminimumkan sisa pemotongan balok kayu di UD Sinar Jaya Abadi Depok dapat dilakukan dengan memotong 2,5 meter panjang balok kayu sebanyak 190 batang dengan kombinasi pola pemotongan yang optimal yaitu kombinasi pola 1 sebanyak 50 batang, pola 6 sebanyak 20 batang, pola 12 sebanyak 80 batang, pola 26 sebanyak 30 batang, dan pola 38 sebanyak 10 batang., One-dimensional cutting stock problem (CSP) is a cutting problem whose cutting pattern is based only on one dimension. This cutting aims to minimize the trim loss from the cuts. This study will examine the problem of timber cutting at UD Sinar Jaya Abadi Depok to obtain the optimal combination of cutting patterns that minimize the remaining results of timber cutting. In this research column generation technique is used with pattern generation algorithm help. In the first stage, the pattern generation algorithm is used to determine all the feasible cutting patterns. Next, CGT is used to find a combination of cutting patterns that can minimize trim loss. The result obtained to minimized the trim loss of timber cutting at UD Sinar Jaya Abadi Depok has done by cutting a 2,5 meters timber of 190 sticks with the optimal combination of cutting patterns, namely a combination of pattern 1 as many as 50 sticks, pattern 6 as many as 20 sticks, pattern 12 as many as 80 sticks, pattern 26 as many as 30 sticks, and pattern 38 as many as 10 stickies.
Keyword: column generation technique, cutting stock problem, pattern generation, sisa pemotongan, column generation technique, cutting stock problem, pattern generation, trim loss

Judul: Masalah Cutting Stock Satu Dimensi yang Meminimumkan Banyaknya Pola Berbeda
Abstrak: Cutting stock problem (CSP) merupakan masalah menentukan cara terbaik agar objek yang berukuran besar dapat dipotong menjadi objek yang berukuran lebih kecil sesuai permintaan dan sisa yang minimum. Namun selain bertujuan meminimumkan sisa bahan, ada masalah lain dalam CSP yaitu meminimumkan banyaknya pola pemotongan yang berbeda. Hal ini disebabkan karena adanya biaya setup setiap suatu pola berbeda dipotong. Karya ilmiah ini bertujuan untuk mendapatkan banyaknya pola berbeda yang optimal pada suatu masalah agar biaya pemotongan minimum. Suatu masalah pembangunan 12 pendopo akan dimodelkan ke dalam cutting stock satu dimensi yang meminimumkan banyaknya pola berbeda dalam bentuk pemrograman linear. Model ini diselesaikan dengan algoritme column generation dan menggunakan perangkat lunak Lingo 18.0. Hasil optimal yang diperoleh adalah lima pola pemotongan besi yang berbeda dengan biaya pemotongan besi berupa pendekatan sebesar Rp270.513.000,00. Jumlah total stok besi yang digunakan adalah 93 batang besi baja yang terdiri dari pola 5 sebanyak 48 besi, pola 7 sebanyak 3 besi, pola 8 sebanyak 21 besi, pola 11 sebanyak 15 besi, dan pola 12 sebanyak 6 besi., Cutting stock problem (CSP) is a problem to determine the best way so that the large objects can be cut into smaller objects on demand and with minimum waste. However, besides of minimize material waste, there is another problem with CSP which is to minimize different cutting patterns. This is because there will be setup costs for each different pattern are cut. This scientific work aims to obtain the optimal number of different patterns on a problem so the cutting costs are minimum. A problem about the construction of 12 pavilions will be modeled into a onedimensional cutting stock that minimizes the number of different patterns in linear programming. This model is solved by column generation algorithm and using Lingo 18.0 software. The optimal results obtained are five different iron cutting patterns with the cost of iron cutting in approach is Rp270.513.000,00. The total amount of iron stock used is 93 iron bars, consisting of 48 bars of 5th pattern, 3 bars of 7th pattern, 21 bars of 8th pattern, 15 bars of 11th pattern, and 6 bars of 12th pattern.
Keyword: column generation, cutting stock problem, different pattern, linear programming, setup cost

Judul: The Leukocyte Profile of Pregnant Friesian Holstein Cows vaccinated with Escherichia coli K99 polivalen vaccine.
Abstrak: The objective of this experiment was to study the leukocyte profile of pregnant cows vaccinated with E.coli K99 polivalen vaccine. Three pregnant Friesian Holsteins cows were used in this experiment. Before the administration of vaccine, the cows were given a series of immunomodulator injection for three days. The vaccinations were administered three times at 8, 6, and 4 weeks before calving. Blood were drawn through jugular vein, first before the administration of vaccines, then weekly until calving. Based on the observation, it can be concluded that the administration of E.coli K99 polivalen vaccine in pregnant cows not affected the leukocyte profile. Keywords : Escherichia coli vaccine, leukocyte profile, differential leukocyte
Keyword: