Judul: Penjadwalan Petugas Keamanan Menggunakan Integer Linear Programming: Studi Kasus di Institut Pertanian Bogor
Abstrak: One of the problems that often arises in a security management system is the problem of scheduling security officers. A proper scheduling of security officers is required to avoid fatigue on officers, both psychologically and physically which can degrade the performance of the officers. This paper presents an integer linear programming model to establish a timetable for the security personnels. The objective function of this model is to minimize the total load shift of officers on the night shift so that the morning shift has a greater chance to be scheduled without reducing the total days of services. This model is then applied to schedule the security officers on campus of Bogor Agricultural University.
Keyword: minimize the total load., integer linear programming, scheduling, Bogor Agricultural University (IPB)

Judul: Penjadwalan Petugas Satuan Pengamanan Menggunakan Nonpreemptive Goal Programming dan Implementasinya di Institut Pertanian Bogor.
Abstrak: Salah satu permasalahan yang sering ditemukan pada manajemen sistem keamanan adalah masalah penjadwalan Satuan Pengamanan (Satpam). Dalam penjadwalan Satpam perlu diperhatikan hal-hal yang terkait dengan banyaknya kebutuhan anggota Satpam pada setiap shift di setiap hari, keseimbangan banyaknya shift pagi, sore, dan malam yang diperoleh masing-masing anggota Satpam, keadilan penugasan antar anggota baik terkait dengan total shift penugasan maupun terkait dengan komposisi banyaknya shift pagi, siang, dan malam yang ditugaskan ke masing-masing anggota dan pola perpindahan penugasan anggota dari satu tipe shift (pagi, siang, atau malam) ke shift tipe lain. Permasalahan penjadwalan Satpam ini dimodelkan sebagai suatu model optimasi dengan tujuan meminimumkan total deviasi antara banyaknya anggota yang dibutuhkan dengan anggota yang ditugaskan untuk setiap shift selama periode perencanaan. Karena fungsi tujuan semacam itu, masalah ini dimodelkan sebagai Nonpreemptive Goal Programming. Model ini diimplementasikan untuk kasus penjadwalan Satpam di Institut Pertanian Bogor.
Keyword: penjadwalan, goal programming, nonpreemptive goal programming

Judul: Posisi Filogenetik Kura-Kura Carettochelys Insculpta  (Reptillia: Testudinata)
Abstrak: Carettochelys insculpta is an endemic freshwater turtle of southern Papua and northern Australia. Phylogenetic position of this turtle is remain unresolved until now. Most of the research conducted show close relationships of C. insculpta and members of Trionychidae family. However, some of the research show distance between C. insculpta and members of Trionychidae family. This research is conducted to analyze phylogenetic relationship between C. insculpta and other members of Testudinata using 12S rRNA, 16S rRNA, and both gene as markers. DNA samples were obtained from three different organisms of C. insculpta. Two species used as outgroups were Alligator mississippiensis and Iguana iguana. Phylogenetic analysis was carried out using Neighbor-Joining method with Felsenstein 1981 (F81) modeltest. A polytomy tree of Testudinata was produced by using 12S rRNA gene. However, analysis using 16S rRNA and both genes as markers confirmed that C. insculpta was located between the Chelonidae and the Trionychidae family.
Keyword: