Repi Meilani Putri
Unknown Affiliation

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

Found 2 Documents
Search

Desain dan Implementasi Web Pemesanan Makanan untuk Mempercepat Proses Antrean Pelanggan Rifqi Putra Winanda; Nazwa Salsyabilla Ramadhani; Repi Meilani Putri; Nuriana Sipahutar
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 3 No. 6 (2025): November : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v3i6.781

Abstract

Lengthy, disorganized physical queues in conventional food ordering systems, particularly within canteens, significantly compromise customer convenience and operational efficiency. This direct-ordering model often results in crowd congestion, unpredictably long waiting times, and potential friction among patrons. To address these operational issues and substantially enhance user satisfaction, this research proposes the development and implementation of an innovative Web-Based Food Ordering System. This digital platform allows customers to place orders entirely online, effectively eliminating the need for physical queuing. The system's core functionality is the realtime monitoring of order status and queue position, providing transparent information directly to the customer's device. For canteen management, the application offers a crucial tool for integrated and structured order handling, ensuring staff can prepare meals more accurately and promptly. By transforming the ordering process into a streamlined digital workflow, the system is expected to accelerate the service cycle, minimize unnecessary crowding, and substantially improve customer satisfaction through a modernized, well-organized, and highly efficient experience. This initiative represents a significant step toward smarter and more responsive food service operations.
Optimasi Alokasi Sumber Daya Bantuan Sosial : Pendekatan Algoritma Greedy dan Analisis Komputasi Maulana Al Nouri; Tia Risky Yasmin Saketang; Repi Meilani Putri; Paskal Arienda Epidonta Ginting; Adidtya Perdana
Merkurius : Jurnal Riset Sistem Informasi dan Teknik Informatika Vol. 4 No. 3 (2026): Mei: Merkurius : Jurnal Riset Sistem Informasi dan Teknik Informatika
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61132/merkurius.v4i3.1556

Abstract

The distribution of social assistance in Indonesia faces challenges such as inaccurate recipient data, overlapping programs, and limitations of traditional data management systems that lead to inaccurate targeting of aid. This study proposes a social assistance distribution optimization system using the Greedy algorithm that assesses recipient priorities based on economic conditions, number of family members, location, and urgency of needs with certain weights to produce objective rankings. This system is implemented in a JavaScript-based web application without external frameworks, making it lightweight and easily accessible. Simulations with 20 prospective recipients and a quota of 10 slots and validation with a dataset of 10,000 entries show that the Greedy algorithm produces identical results to Dynamic Programming but is much faster (669 times faster). In terms of complexity, this algorithm has O(n log n) time and O(n) space, and meets the requirements of the Greedy Choice Property and Optimal Substructure, making it a practical and efficient solution for managing large-scale social assistance distribution in Indonesia.