Judul: Studi Beban Kerja pada Pemanenan Kelapa Sawit di PTPN VIII Kebun Cikasungka, Bogor.
Abstrak: Saat ini proses pemanenan kelapa sawit masih dilakukan secara manual sehingga menghasilkan banyak variasi kualitas panen. Penelitian ini bertujuan untuk menghitung dan membandingkan tingkat kejerihan, kebutuhan energi, dan kapasitas kerja setiap elemen kerja dan kondisi lapangan dalam proses pemanenan. Studi beban kerja ini dilakukan dengan pendekatan ergonomika yaitu studi beban kerja melalui metode pengukuran denyut jantung. Berdasarkan hasil penelitian, diketahui bahwa tingkat kejerihan terendah terjadi pada elemen kerja Preparasi (Pr) dengan nilai IRHR 1.76 (kategori berat) dan yang tertinggi pada elemen kerja mengangkut Tandan Buah Segar (TBS) dengan bantuan alat pikul (MoAP) dengan nilai Increase Ratio of Heart Rate (IRHR) 2.30 (kategori sangat berat). Laju konsumsi energi kerja terendah per elemen kerja yaitu pada loading (Lo) sebesar 2.712 kkal/menit dan yang tertinggi pada cutting di lahan miring (CuR) sebesar 6.201 kkal/menit. Total konsumsi energi yang dibutuhkan untuk memanen satu TBS adalah 12.474 - 25.234 kkal/tandan. Sedangkan kapasitas kerja ideal sesuai kondisi kerja di lokasi studi yaitu 11-16 tandan/jam (kerja efektif). Total konsumsi energi tertinggi dan kapasitas kerja terendah terjadi pada kondisi lahan miring, tinggi pohon > 6 m, usia > 30 tahun, dan pengalaman kerja < 10 tahun.
Keyword: beban kerja, kelapa sawit, pemanenan

Judul: Analisis Beban dan Kapasitas Kerja pada Aktivitas Pemanenan Kelapa Sawit Secara Manual di PT. Astra Agro Lestari
Abstrak: Oil palm is one of the main plantation commodities in Indonesia. The important factors that must be considered to produce palm oil (CPO and PKO) with a maximum quality is the manual harvesting method. The aims of this research is to identify the labour work load and energy cost in the harvesting activities, and based on that to find out the ideal working capacity of the harvesting worker. The work load and work energy cost analysis were conducted based on heart rate measurement. Eight workers of under 30 years of age and eight workers of over 30 years of age were observed as the subjects. The tree height and relief of the land were the main working variables which took a place in the experimental design. In the case of subjects aged > 30 years old, it can be seen that the harvesting energy consumption rate using egrek in R2 land (6.23 kcal /stem) has a lower value than the R3 land (7.71 kcal/stem) as well as in the case of subjects aged < 30 years old with a value of R2 (6.47 kcal/stem) and R3 (7.99 kcal/stem). Moreover, the energy consumption rate of harvest activity using dodos is also lower for the subjects aged > 30 years old (5.33 kcal/stem) compared to subjects aged < 30 years old (5.70 kcal/stem). Based on this value, it noteworthly shows that the subject aged < 30 years old has the greater energy consumption rate (work load). The amount of energy consumption rate is highly influenced by the skill level of workers which then resulted a greater fatigue level. Briefly, the greater energy consumption rate, the lower ideal capacity most likely to be generated
Keyword: 

Judul: Pelabelan Super Vertex Magic
Abstrak: Super vertex magic labeling is labeling on graph with is a set of edges mapped into and is a set of vertices mapped into . It has a vertex magic labeling in which and represents the size and order of the graph respectively. This manuscript proves that paths, cyclics, and disjoint union of cyclics have a super vertex magic labeling. There are four theorems to be discussed. The first theorem proves that path is super vertex magic if and only if is odd and . The second theorem proves that cyclic is super vertex magic if and only if is odd. The third theorem proves that bijection function from an edge set onto of graph can be extended to a super vertex magic labeling if and only if the set amount of edge label that incidents with a vertex in the graph, consists of sequential integers as many as vertices in the graph. The fourth theorem proves that disjoint union of the cyclics consists of cyclics with each cyclic has vertices is super vertex magic if and only if and are odd.
Keyword: