Article Per Year (5 Year)
p-Index From 2021 - 2026
0.659
P-Index
This Author published in this journals
All Journal Jurnal Elektronika dan Teknik Informatika Terapan Bilangan: Jurnal Ilmiah Matematika, Kebumian dan Angkasa Algoritma: Jurnal Matematika, Ilmu Pengetahuan Alam, Kebumian dan Angkasa
Bulan Naysabilla
Unknown Affiliation
Astronomy Computer Science & IT Earth & Planetary Sciences Mathematics

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

Found 3 Documents
Search

 1 
Mengenal Dan Memahami Notasi Penulisan Dalam Algoritma Pemrograman Bulan Naysabilla; Yahfizham Yahfizham
Jurnal Elektronika dan Teknik Informatika Terapan ( JENTIK ) Vol. 1 No. 4 (2023): Desember: Jurnal Elektronika dan Teknik Informatika Terapan (JENTIK)
Publisher : Politeknik Kampar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59061/jentik.v1i4.504

Abstract

Programming is a way that can be used in instructing computers to carry out certain tasks. Computer instruction means providing a set of commands that can be notated in a language understood by the computer. A program is a set or series of instructions to solve a problem. While the algorithm is a sequence of logical instructions in solving a problem that is arranged systematically. The purpose of this research is to facilitate the community, especially from students and students in the notation of writing programming algorithms on computer use. For the writing of this journal, the author uses the method of literature research among others by reading and studying books, articles, laws and other literature sources related to problems in this journal. From the results of the study, it can be shown that programming algorithms have three ways to notify the writing of programming algorithms, namely by means of descriptive sentences, flowcharts and pseudecode.
Systematic Literature Review : Penerapan Metode Branch and Bound dalam Optimalisasi Produksi Sherly Putri Revika; Jamiah Nurhakiki; Bulan Naysabilla; Siti Salamah Br Ginting
Bilangan : Jurnal Ilmiah Matematika, Kebumian dan Angkasa Vol. 3 No. 3 (2025): Juni: Bilangan : Jurnal Ilmiah Matematika, Kebumian dan Angkasa
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/bilangan.v3i3.596

Abstract

This study presents a Systematic Literature Review (SLR) focusing on the application of the Branch and Bound (B&B) method in production optimization. In modern industry, achieving operational efficiency and profitability is essential, yet optimization often yields fractional solutions that are unrealistic for indivisible entities. The Branch and Bound method, as part of Integer Programming, has proven effective in addressing these constraints by converting fractional solutions into optimal integer values. This SLR analyzed 12 scientific articles published between 2016 and 2024, sourced from databases such as Google Scholar, Scopus, and SINTA. The analysis reveals that B&B is widely utilized to maximize production profit across various sectors, including spring beds, woven fabrics, bread, and furniture, often formulated as Integer Linear Programming (ILP) problems. Furthermore, this method is also applied to minimize production time and determine the shortest routes. Overall, B&B is a flexible and efficient tool that assists companies in managing resources and achieving maximum profit with realistic integer solutions.
Systematic Literature Review: Analisis Penggunaan Program Dinamik dalam Perencanaan Produksi dan Pengendalian Persediaan Bulan Naysabilla; Miftah Khairiyah SM; Icha Amelia; Siti Salamah Br Ginting
Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa Vol. 4 No. 1 (2026): Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/algoritma.v4i1.915

Abstract

Production planning and inventory control are critical aspects of operations management, as they directly influence cost efficiency, resource utilization, and the continuity of the production process. Ineffective planning and inventory decisions may lead to excessive costs, production delays, or imbalances between supply and demand. The complexity of these problems, which often involve multi-period horizons and multi-stage decision-making processes, has encouraged the application of quantitative optimization methods, one of which is dynamic programming. This study aims to analyze and synthesize the application of dynamic programming in production planning and inventory control through a Systematic Literature Review (SLR) approach. The SLR process was conducted by systematically identifying, selecting, and analyzing 15 relevant national journal articles published between 2015 and 2024 and obtained from various recognized scientific databases. The reviewed literature indicates that dynamic programming is effective in supporting optimal decision-making by determining appropriate production quantities and inventory levels, minimizing total production and holding costs, and managing fluctuating demand conditions. In addition, this method helps reduce the risks associated with overstock and stockouts by considering sequential decision structures. However, the findings also reveal several limitations of dynamic programming, including high computational complexity, strong dependence on deterministic data assumptions, and limited flexibility in handling high levels of uncertainty. These constraints suggest the need for further methodological development or integration with other approaches to enhance practical applicability.
Co-Authors Icha Amelia Jamiah Nurhakiki Miftah Khairiyah SM Sherly Putri Revika Siti Salamah Br Ginting yahfizham yahfizham