Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Syntax Fusion : Jurnal Nasional Indonesia

KARAKTERISTIK KAPASITAS PERBANDINGAN MASSA MATEIAL TiO2:rGO PADA SUPERKAPASITOR Sinta Marito Siagian; Samaria Chrisna HS; Ferdinan R Tampubolon; Suci Khiarani; Agustina Ginting; Rischa Devita
Jurnal Syntax Fusion Vol 3 No 10 (2023): Jurnal Fusion: Jurnal Nasional Indonesia
Publisher : Rifa' Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54543/fusion.v3i10.369

Abstract

The aim of this research is to analyze the capacitance value of a supercapacitor using TiO2 and coconut shells as organic rGO from natural waste. The method used to produce this material is to use wet chemistry by adding H2SO4 to coconut shell carbon to improve its electrolyte properties. After that, when applying a supercapacitor, phosphoric acid is used. The results obtained from this research are that the highest value is in a ratio of 1:1 at a value of 489 µF with a decrease in the last measurement at a value of 426 µF, while the lowest capacitance value is in a ratio of 1:3. Based on the measurement results obtained a capacitance value of 58 µF and a reduction value capacity up to 53 µF.
Pengembangan Algoritma Tabu Search Berbasis Bilangan Grey Untuk Optimalisasi Flexible Job Shop Dengan Ketidakpastian Ferdinan R Tampubolon; Sinta Siagian; Samaria Chrisna HS; Rischa Devita
Jurnal Syntax Fusion Vol 3 No 10 (2023): Jurnal Fusion: Jurnal Nasional Indonesia
Publisher : Rifa' Institute

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54543/fusion.v3i10.370

Abstract

This research aims to make a step-by-step process to determine the most optimal completion time for the Flexible Job Shop Scheduling case. Flexible Job Shop Scheduling which not only aims to sequence operations on jobs but also chooses the machine to be used in processing an operation makes this scheduling more complicated than ordinary Job Shop Scheduling. This scheduling involves interval-shaped gray numbers to accommodate uncertainty in job ordering time. This further extends the complexity of scheduling. To solve this case a metaheuristic algorithm namely Tabu Search will be used. This algorithm uses mutation on the solution a number of iterations until it produces the best solution. The use of a tabu list in the Tabu Search algorithm to ensure the search is not trapped in the local minimum.