Publication Search

70,604 articles from 612 journals · 1,760 citations tracked

Showing 1-2 of 2

Analytics

Anabella Monica Agustine Simanjuntak

Jurnal Penelitian Manajemen dan Inovasi Riset 2025 Asosiasi Riset Ilmu Manajemen Kewirausahaan dan Bisnis Indonesia

The Hungarian method is a mathematical optimization algorithm used to solve assignment problems by finding the optimal allocation of resources to tasks. This research examines the application of the Hungarian method for both balanced and unbalanced maximization assignment problems. The balanced assignment problem involves an equal number of workers and jobs, while the unbalanced problem deals with unequal numbers. The study aims to analyze the effectiveness of the Hungarian method in solving maximization problems through mathematical modeling and algorithmic implementation. The research methodology includes literature review, mathematical analysis, and computational testing using various case scenarios. Results demonstrate that the Hungarian method can effectively solve both balanced and unbalanced maximization assignment problems by converting them into minimization problems through matrix transformation. The balanced cases show direct application of the classical Hungarian algorithm, while unbalanced cases require the addition of dummy variables to achieve matrix balance. The method proves to be efficient with polynomial time complexity O(n³), making it suitable for real-world applications. The research concludes that the Hungarian method provides optimal solutions for resource allocation problems in various organizational contexts, contributing to improved operational efficiency and cost-effectiveness in decision-making processes.  

Pesta Gultom; Elisma Putri Br Barus; Jupita Mariana Manullang; Emriahta Br Damanik; Ribka Nduru

Jurnal Penelitian Manajemen dan Inovasi Riset 2025 Asosiasi Riset Ilmu Manajemen Kewirausahaan dan Bisnis Indonesia

This study explores the optimization of non-normal assignments utilizing the Hungarian method for both maximization and minimization. The Hungarian algorithm is a combinatorial optimization technique that efficiently solves assignment problems, ensuring optimal allocation of resources. By applying this method to non-normal assignment scenarios, we aim to demonstrate its effectiveness in enhancing productivity and reducing costs in various industries. The findings indicate that the Hungarian method can significantly improve decision-making processes in complex assignment frameworks, leading to more efficient operations.