Judul: Teknik Granulasi Dalam Pemanfataan Debu Teh Pada Produksi Teh Celup di PT Unilever Tbk Pabrik Tea Based Beverages Cikarang - Bekasi
Abstrak: Tea dust is one of the solid waste generated during manufacturing of tea bags in the Tea Based Beverage Factory, PT Unilever Indonesia Tbk, Cikarang - Bekasi. The amount of tea dust that is separated by dust collector at the tea factory is up to 500 kg per week. The tea dust could not be used in the tea bags production because of its particle size and light mass, so after separation by dust collector if then blended into the tea will affect the appearance and quality of the tea..This waste caused the factory loss its profit about 7 million rupiah per week. A process technique of granulation was used for tea dust to increase both the particle size and the mass. The granule form of the tea dust ensured that it could not be separated again by the dust collector after it was blended into the tea. Equipments such as cold extruder or fluidized bed granulator were used to form the granules and fluidized beddryer to dry the granules. After tea granules successfully formed, then it was mixed by blending the tea and filled it into a tea bag with a composition of 99.5% tea and 0.5% tea dust granules. Various kinds of test conducted to examine if the granulated tea dust would affect the quality of the tea bag, and the results showed that the granule was not affecting the quality of the tea bag based on the standard set by Unilever.
Keyword: 

Judul: Reduction of Off-grade Products in Green Tea Production at XYZ Ltd.
Abstrak: Beberapa tingkat kualitas teh hijau yang dihasilkan oleh PT XYZ, yaitu MT (daun utuh/peko), bubuk, tulang, dan sweeping (limbah). Bubuk, tulang, dan sweeping dikategorikan menjadi produk off-grade. Sweeping merupakan jenis produk off-grade tertinggi yang terdapat pada hasil akhir teh hijau sebesar 4-6% per total produk sehingga perlu dilakukan reduksi dengan metode plan-do-check-action (PDCA) yang terdiri dari 8 langkah gugus kendali mutu (GKM) dan beberapa dari 7 alat bantu (check sheet, flowchart, histogram, diagram pareto, dan diagram ishikawa). Setelah diplotkan kedalam diagram ishikawa, diperoleh permasalaah utama pada mesin, yaitu perbedaan design pelat antara penutup dan corong ball tea sehingga dilakukan penyamaan desgin pelat antara penutup dan corong ball tea. Penurunan persentase produk sweeping (off-grade) terhadap total produk yang diperoleh setelah perbaikan sebesar 23%. Penurunan tersebut belum mencapai target penurunan sweeping pabrik PT XYZ sebesar 30% dan persentase sweeping pabrik lain sebesar 32% sehingga belum memuaskan. Hal ini disebabkan oleh faktor dana dan waktu sehingga belum dapat dilakukan perbaikan lebih banyak., XYZ Ltd produces several quality levels of green tea : MT (whole leaf/peko ), powder, bone, and sweeping (waste). The Off-grade products consist of powder, bone, and sweeping. Sweeping is the highest type of off-grade product of 4-6% per total product yield. This research were used the plan, do, check, and action (PDCA) method which consists of 8 steps of the quality control circle (QCC) and some of the seven tools (check sheet, flowchart, histogram, pareto chart, and ishikawa chart). After were being plotted on the Ishikawa diagram and the main problem with the machine were gotten, the difference in plates were designed between the lid and the ball tea funnels so the plates were designed to equalize between the cover and the ball tea funnels. The decrease in the proportion of sweeping product (off-grade) to the total product was obtained after improvement about 23%. This decrease had not yet reached the target of reducing sweeping at PT XYZ's factory by 30% and the proportion of sweeping at other factories by 32%, so it was unsatisfactory. This was due to the factors of funds and time so that more improvements could not be made.
Keyword: sweeping, off-grade, green tea, PDCA, QCC

Judul: Construction of Strongly Optimal Binary Linear Code with Minimum Distance 9 and 11
Abstrak: A binary linear code of length n over q F is a subspace of n q F . A code has three parameters that attached to it, namely length, dimension, and minimum distance. A code with length n, dimension k and minimum distance d is often called [n, k, d ]-code. Usually, when two parameters are given, then we want to find a code that has the best value for the last parameter. Based on Gilbert- Varshamov bound, if a [n, k, d ]-code exists and can not be expanded, we call it a strongly optimal code. In this paper, we construct strongly optimal code with minimum distance 9 and 11. In constructing the code, we created a theorem and algorithm based on Gilbert-Varshamov bound before we implement the algorithm to MAPLE programming language. Because of computational limitations, the program can only construct up to k = 10 for d = 9 and k = 12 for d = 11.
Keyword: