Claim Missing Document
Check
Articles

Found 2 Documents
Search

OPTIMASI PENENTUAN RUTE DAN JALUR TERAMAN PENYETORAN KAS OPERASIONAL MENGGUNAKAN METODE SHORTEST ROUTE PADA QM FOR WINDOWS Jhon Kristopel Manalu; Dian Eka Matra Putra Bangun; Parapat Gultom
JURNAL MULTIDISIPLIN ILMU AKADEMIK Vol. 3 No. 5 (2026): Oktober
Publisher : CV. KAMPUS AKADEMIK PUBLISHING

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61722/jmia.v3i5.11976

Abstract

Church financial management demands operational efficiency as well as a high level of security, particularly in physical transactional activities such as depositing congregational cash to partner banks. This study aims to determine the shortest route, fastest travel time, and safest path for conducting cash deposit activities from the Secretariat of the Methodist Church of Indonesia (GMI) Kasih Karunia to the destination bank. A quantitative approach was employed through network modeling using the Shortest Route Method, solved using the QM for Windows application. The weight variables in this network include geometric distance (meters), average travel time (minutes), and an operational security/risk vulnerability index. The results of the QM for Windows model analysis show that by integrating these three external variables, the system successfully identified the optimal route that balances logistical efficiency and street crime risk mitigation, providing a standard operational route recommendation for the church secretary.
APLIKASI METODE ASSIGNMENT DALAM OPTIMASI PENANGANAN PERKARA HUKUM PADA KANTOR ADVOKAT: PENDEKATAN ANALISIS KUANTITATIF BERBASIS QM FOR WINDOWS Dian Eka Matra Putra Bangun; Jhon Kristopel Manalu; Parapat Gultom
JURNAL ILMIAH PENELITIAN MAHASISWA Vol 4 No 4 (2026): Agustus
Publisher : Kampus Akademik Publiser

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61722/jipm.v4i4.2789

Abstract

Operational management in law firms faces significant challenges in allocating limited time resources amidst high demand for case handling. This study aims to optimize the assignment of legal cases to advocates in order to minimize the total case completion time using the assignment method. The data consists of an estimated time matrix (in days) for four advocates handling four types of cases, namely Criminal Cases, Civil Cases, Industrial Relations Cases, and Intellectual Property Rights (IPR) Cases. Data analysis was conducted using QM for Windows (POM-QM) software. The optimization results show that systematic work distribution produces an efficient one-to-one allocation with a minimum total completion duration of 32 days. The implementation of this linear programming model is proven effective in assisting law firm management in making strategic decisions based on formal data.