Claim Missing Document
Check
Articles

Found 2 Documents
Search

Analisis Studi Literatur Pengkajian Algoritma Dan Pemrograman Mahasiswa Di Revolusi Industri Teknologi Pada Jurusan Pendidikan Matematika Miftah Khairiyah SM; Yahfizham Yahfizham
Konstanta : Jurnal Matematika dan Ilmu Pengetahuan Alam Vol. 1 No. 4 (2023): Desember : Jurnal Matematika dan Ilmu Pengetahuan Alam
Publisher : International Forum of Researchers and Lecturers

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59581/konstanta.v1i4.1731

Abstract

Particularly in the context of the technological industrial revolution, information technology is developing more quickly. We cannot prevent technological development in this life because it will inevitably follow scientific advancements in science. Educational technology has the power to transform traditional teaching methods into innovative ones. Even though the term "educational technology" has a very broad definition, it is frequently assumed to refer only to electronics or other technical tools. For this reason, we will talk more about educational technology in this article, particularly as it relates to its development in the context of science's rapid advancement. as well as society culture and technology Programming breakthroughs have virtually eliminated the need for manual implementation Our work and interests these days often stress our proficiency with computers. Logical thinking is crucial to the development of this revolution in order to comprehend its components, particularly the interconnectedness of computer programming algorithms and mathematics. In order to ascertain the actualization of this programming procedure, the literature analysis method was employed in the composition of this work. The sources for this article's collection included books and a number of earlier publications, the titles of which were created using bibliometric techniques. Thus, it is believed that the development of technological knowledge can proceed without hiccups with the involvement of algorithmic programming so that students can enhance the caliber of the amalgamation of technological information in the industrial revolution.
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.