Judul: One-dimensional Cutting Stock Problem Solution: Optimization Case of  Light Steel Cutting Waste
Abstrak: Rumah merupakan kebutuhan primer bagi manusia. Salah satu komponen dari rumah yaitu atap yang rangka nya terbuat dari kayu atau baja ringan. Mempertimbangkan aspek harga bahan baku, daya tahan, dan biaya pekerja menjadikan baja ringan lebih ekonomis dan praktis untuk digunakan. Pemotongan baja ringan yang tidak terencana dengan baik dapat menyebabkan banyak sisa material tidak terpakai dan ongkos produksi yang besar. Penelitian ini memperlihatkan penyelesaian masalah pemotongan stok (cutting stock problem) satu dimensi pada rangka atap rumah dari baja ringan. Tujuannya adalah menentukan pola pemotongan sehingga keperluan baja ringan terpenuhi dan menghasilkan sisa potong baja ringan yang minimum. Masalah pemotongan stok ini dimodelkan sebagai masalah pemrograman linier integer, kemudian diselesaikan dengan metode eksak. Melalui bantuan Solver pada perangkat lunak Microsoft Excel, diperoleh solusi optimal yang meminimalkan sisa pemotongan sebesar 16.45 m atau 7.83% dari total 210 m baja ringan yang digunakan., House is a primary need for humans. One of the components of the house is the roof, whose frame is made of wood or light steel. Considering raw materials price, durability, and labour costs, light steel is more economical and practical. Cutting light steel that is not planned correctly can result in many unused materials and high production costs. This study shows the solution to the one-dimensional cutting stock problem on the roof truss of a light steel house. The goal is to determine the cutting pattern so that the needs of light steel are met and produce a minimum of cutting scraps of light steel. This cutting stock problem is modelled as an integer linear programming problem, and then solved by an exact method. With the help of Solver on Microsoft Excel software, the optimal solution was obtained, which minimized the remaining cutting by 16.45 m or 7.83% of the total 210 m of light steel used.
Keyword: cutting stock problem, integer linear programming, light steel, optimization

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: Profil Antibodi IgM dan IgG pada Beruk (Macaca nemestrina) setelah Diinfeksi Virus Dengue Serotipe-3 (DEN-3) melalui Rute Intravena
Abstrak: The aim of this study was to detect IgM and IgG in pig-tailed macaques (Macaca nemestrina) primarily innoculated by Dengue virus serotype-3 (DEN-3) by intravenous route. A total of 84 plasma samples were examined in the study. Plasma samples were taken on day 0 before infection, followed by plasma collections on day 1 through day 13 post infection. The obtained plasma samples were analyzed using indirect ELISA test. The results showed the increasing titer of IgM started on day-3 post infection with its peak occurred on day 11 post infection and started to decline afterward; while the IgG titer started to increase on day 6 or day 7 post infection and continue to increase until the day 13 post infection. These results showed that in a primary infection of DEN-3 byintravenous route, the tendency of IgM titer increase was higher than the IgG titer increase; also shown that the IgM titer increase was occured earlier than IgG. The profile of IgM and IgG antibodies is outlined in this study.
Keyword: