Claim Missing Document
Check
Articles

Found 2 Documents
Search

Analisis Studi Literatur Penerapan Algoritma Pemrograman pada Internet of Things (IoT) Muhammad Murdani; Yahfizham Yahfizham
Jurnal Sadewa : Publikasi Ilmu Pendidikan, pembelajaran dan Ilmu Sosial Vol. 2 No. 1 (2024): Februari : Publikasi Ilmu Pendidikan, pembelajaran dan Ilmu Sosial
Publisher : Asosiasi Riset Ilmu Pendidikan Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61132/sadewa.v2i1.507

Abstract

By using literature studies/literature research, this article discusses how programming algorithms can be applied to the Internet of Things (IoT). The purpose of this article is to explain the function of algorithms in Internet of Things (IoT) programming and several examples. IoT is a concept where various devices and objects can connect and communicate with each other via the internet network. After data is collected through text study, content analysis techniques are used to analyze it. Literature studies show that programming algorithms must be applied to the Internet of Things to ensure efficient collection, analysis and use of data from connected objects. Programming algorithms are widely used for data prediction and analysis, network management, data collection and processing, security, and optimization of communication between IoT objects. Internet of Things developers and researchers should pay attention to the importance of implementing appropriate programming algorithms in their systems because these algorithms enable IoT to optimize the use of resources such as bandwidth, memory, and energy. Efficient algorithms enable smarter data analysis and better data security.
Studi Literatur tentang Penerapan Program Linear Bilangan Bulat dalam Optimasi Penjadwalan dan Alokasi Sumber Daya Melinda Azizah; Sabrina Aisha Putri Lubis; Muhammad Murdani; Inna Muthmainnah Dalimuntha; Siti Salamah Br. Ginting
Algoritma : Jurnal Matematika, Ilmu pengetahuan Alam, Kebumian dan Angkasa Vol. 3 No. 4 (2025): 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.v3i4.626

Abstract

Scheduling and resource allocation are two crucial aspects in various fields, including manufacturing, transportation, education, and information systems. The complexity of decision making is often increased by integer constraints, such as the number of workers, machines, or indivisible working hours. Therefore, the Integer Linear Programming (ILP) approach is one of the methods widely used in solving optimization problems involving discrete variables. This literature study aims to review previous studies that apply ILP in the context of scheduling and resource allocation optimization. This study reviews model approaches, solution techniques such as the branch and bound method and cutting plane, and their implementation in various real cases. The results of the study show that ILP is able to provide optimal or near-optimal solutions in scenarios with complex constraints and integer variables. This study also identifies challenges in implementing ILP models, such as the scale of the problem and high computational requirements, as well as opportunities for further research that includes hybridizing the ILP method with a heuristic approach. Thus, ILP remains a very relevant and effective tool in supporting optimization-based decision making in various sectors.