Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal JAIS (Journal of Applied Intelligent System) Journal of Informatics and Electronics Engineering
Riri Damayanti Apnena
Politeknik TEDC Bandung
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
A Good Relative Percentage Increase (RPI) of Variant Job Scheduling Using Artificial Bee Colony (ABC) Riri Damayanti Apnena; Firdhani Faujiyah
Journal of Applied Intelligent System Vol 7, No 1 (2022): Journal of Applied Intelligent System
Publisher : Universitas Dian Nuswantoro and IndoCEISS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33633/jais.v7i1.5989

Abstract

Artificial Bee Colony (ABC) which is a development of the intelligent swarm model and is a branch of artificial intelligence based on self-organization systems. Artificial Bee Colony (ABC) is an intelligent algorithm that is inspired by the food search process carried out by bees. This is like what is done when there are many jobs that need to find the optimal value, where each job to be processed has a specific route of operations to be performed on a set of machines, and a different flow shop and variant: all jobs follow the same machine sequences. We will focus on the latter. In this study, ABC is implemented to optimize work scheduling, in this case 7 different variations are used with mxn values between 10x3 to 40x15 on 10 to 40 jobs. To evaluate the results, the Relative Percentage Increase (RPI) has been used in the test with an achievement range between 1.9 to 18.9.
Optimasi Penjadwalan Flow Shop Perusahaan Garment dengan Metode Campbell Dudek Smith (CDS), Algoritma Nawaz Enscore Ham (NEH), dan Algoritma Pour dengan Kriteria Minimisasi Makespan Riri Damayanti Apnena
Journal of Informatics and Electronics Engineering Vol 1 No 1 (2021): Juni 2021
Publisher : Unit Penelitian dan Pengabdian kepada Masyarakat Politeknik TEDC Bandung Jl. Pesantren Km 2 Cibabat Cimahi Utara – Cimahi 40513 Jawa Barat – Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (319.571 KB)

Abstract

Perusahaan Garment ini telah menerapkan penjadwalan flow shop dengan sistem First Come First Serve (FCFS). Sistem pada perusahaan memiliki permasalahan saat pesanan datang di saat yang sama akan berpengaruh pada waktu pengerjaan pada mesin yang mengakibatkan timbulnya waktu tunggu atau (idle time) tentu berpengaruh pada nilai makespan. Penelitian ini melakukan perbandingan hasil makespan pada penjadwalan mesin menggunakan berbagai tingkat penyelesaian, yaitu metode penjadwalan mesin (Metode CDS dan Algoritma NEH) dan heuristic penjadwalan mesin (Algoritma Pour) dengan kriteria minimisasi makespan. Nilai makespan dari hasil penjadwalan dengan Metoda CDS adalah 42.45 jam dengan terdapat 2 urutan job-nya yaitu (job 4 - job 3 - job 2 - job 1 - job 5) dan (job 3 - job 1 - job 2 - job 4 - job 5). Nilai makespan dari hasil penjadwalan dengan Algoritma NEH adalah 39.43 jam dengan terdapat 4 urutan job-nya yaitu (job 1 - job 3 - job 4 - job 5 - job 2); (job 1 - job 3 - job 5 - job 4 - job 2), (job 1 - job 5 - job 3 - job 4 - job 2); (job 5 - job 1 - job 3 - job 4 - job 2). Sedangkan nilai makespan dari hasil penjadwalan dengan Algoritma Pour adalah 39.43 jam dengan urutan job-nya yaitu job 5 - job 1 - job 3 - job 4 - job 2 yang artinya sama dengan nilai makespan yang didapatkan pada Algoritma NEH.
Co-Authors Firdhani Faujiyah