Judul: Telaahan Pengelolaan kebun dalam menyediakan pucuk sebagai bahan baku pengolahan teh hitam  : (Studi kasus di Perkebunan Gunung MAs, PT Perkebunan XII Kecamatan Cisarua, Kabupaten Bogor, Jawa Barat)
Abstrak: Industri teh masih mempunyai prospek yang cukup cerah jika dilihat dari adanya peluang konsumsi untuk pasaran internasional dan donenstik. Pengembangan industri teh memerlukan jaminan kepastian bahan baku pucuk teh sebagai komponen utama dari proses pengolahan. Jaminan kepastian akan adanya pucuk mencakup kuantitas dan kualitas dengan biaya yang optimal. PT Perkebunan yang mengusahakan teh umumnya menghada- pi permasalahan tidak tercapainya kapasitas terpasang pada pabrik pengolahan. Artinya PT Perkebunan tidak bekerja secara kapasitas penuh (full capacity). Pengelolaan kebun yang baik dapat menyediakanpucuk teh dengan kuntitas, kualitas dan biaya yang optimal sehingga unit-unit kebun yang ada dapat bekerja secara efisien. Produksi pucuk teh Perkebunan Gunung Mas selama empat tahun terakhir menunjukkan kenaikan sebesar 6,15 persen per tahun. Kenaikan ini disebabkanoleh peningkatan pro- duktivitas kebun-kebun yang ada di Perkebunan Gunung Mas. ...
Keyword: 

Judul: Optimalisasi Produksi Teh Industri : Studi Kasus Pt. Perkebunan Xii Di Gunung Mas Bogor
Abstrak: Perkebunan Gunung Mas selain mengusahakan tanaman teh juga mengolahnya. Teh tersebut diolah menjadi teh hitam CTC (teh kemasan) dan teh celup. Produksi teh kemasan Perkebunan Gunung Mas cenderung menurun sekitar 0,91 persen per tahun dan produksi teh celup berkembang baik dengan laju pertumbuhan rata-rata 39,41 persen per tahun. Tingkat penjualan teh kemasan dan teh celup baik dengan laju pertumbuhan rata-rata masing-masing 3,71 persen dan 41,28 persen per tahun. Namun demikian terjadi over supply dalam persediaan dengan tingkat laju pertumbuhan rata-rata untuk teh kemasan dan teh celup masing-masing sebesar 25,38 persen dan 129,09 persen per tahun. Masalah utama yang dihadapi oleh manajemen Perkebunan Gunung Mas yaitu: Bagaimana perusahaan mengoptimalkan produksi agar seluruh sasaran yang dikehendaki manajemen dapat tercapai semaksimal mungkin. Berdasarkan perumusan masalah tersebut, maka tujuan dari geladi karya ini yaitu: (1) Mempelajari proses pro- duksi pada industri pengolahan teh dan (2) Menentukan dan analisis kombinasi produksi teh olahan yang optimal dengan memperhatikan beberapa sasaran yang dikehendaki manajemen..................................
Keyword: Optimalisasi, Produksi, Teh Industri, PT. Perkebunan XII, Gunung Mas Bogor

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm