Optimalisasi Pendistribusian Susu Nasional dengan Menggunakan Metode Assignment (Hungarian) dan Metode Networking Spanning Tree

The problems at the National Dairy Depot are sales productivity problems, regarding the assignment of workers, as well as regarding the distribution allocation network in Teluk Jambe Timur District, which consists of nine workers. The purpose of this research is to optimize the distance and time in the distribution of National Milk. The method used in the assignment of workers is the Assignment (Hungarian) method, and to optimize the distribution network allocation of milk by using the Networking (Spanning Tree) method. Using these two methods, the optimum total allocation of products sold is 1350 pieces of national milk, and the minimum distance that must be traveled by workers in distributing national milk is 39.18 Km.

Optimalisasi Penugasan Karyawan Jasa Ekspedisi Menggunakan Metode Hungarian (Studi Kasus CV. Anteraja Cabang Mekarmukti)

The Covid-19 pandemic has prompted an increase in e-commerce orders as people prefer to buy their needs online. This impact occurs in the development of the freight forwarding service industry that takes a long time to deliver goods to consumers so that delivery is not optimal in one day. CV. Anteraja Mekarmukti branch is one of the shipping service provider expedition companies that has 14 couriers in charge of delivering packages to 14 delivery points in Cikarang Baru. The problem that is often experienced by CV. Anteraja Mekarmukti branch is related to the allocation of couriers that result in long delivery time. The method used in this study was the Hungarian Method to minimize time by placing courier delivery at the destination. Based on the results of the study, after using the Hungarian Method obtained the delivery time of goods on the CV. Anteraja is 172 minutes, where there is a reduction in the delivery time of goods by 30 minutes and time efficiency by 14.85% when compared to the completion time before using the Hungarian method of 202 minutes.

Analisis Penugasan Guna Meminimumkan Waktu Pengiriman Produk Menggunakan Metode Hungarian pada UKM Roti ZB Cikampek

UKM Roti ZB is a company engaged in the food sector. The problem that is being faced by the company is the assignment of product delivery to consumers, each employee is facilitated by the same means of transportation but has a different delivery time. The purpose of this study is to determine the efficiency of the resulting delivery time using the Hungarian method, as well as to provide settlement arrangements for employee placement in product delivery to consumers based on the Hungarian method. This study uses the Hungarian method and POM-QM for Windows software. Based on the research that has been done, the result is that the total time of product delivery before using the Hungarian method is 89 minutes, while if using the Hungarian method is 85 minutes. So that the time efficiency obtained when using the Hungarian method is 4 minutes. Then there are differences in product delivery assignments before using the Hungarian method, namely Doni to deliver products to Cibuaya, Rahmad to Cilaber, Wawan to Jayakerja, Aldi to Banyusari, and Irwan to Jatisari. Meanwhile, if you use the Hungarian method for Doni for Cilaber, Rahmad for Cibuaya, Wawan for Banyusari, Aldi for Jayakerja, and Irwan for Jatisari.

ANALISIS SENSIVITAS MODEL PENUGASAN DENGAN METODE HUNGARIAN

In linear programming the assignment problem can be solved by the Hungarian method. This method produces an optimal solution for the placement of employees on their assignments. The purpose of this research is to determine the sensitivity analysis of the optimal results from the assignment that has been obtained by the Hungarian Method. Sensitivity analysis is used to determine the extent to which changes can occur without changing the optimal decisions that have been obtained. The results of this research obtain interval working time that can be tolerated without changing the optimal decision that has been obtained. So, no matter how much working time of the Employee changes, as long as the change is still within the interval, it does not interfere with the optimal solution that has been obtained previously.

OPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD

Assignment problem is one of the cases that found in linear programming. Assignment problem is related to the allocation of workers for available jobs. From several sources, Hungarian method is more often used to solve the assignment problem. In the Hungarian method, if an unbalanced problem is found, the lack of the source or destination will be added to the dummy variable so that the case becomes balanced. The jobs that executed on the dummy machine will be ignored. In real-life situations, it is impossible for companies to ignore existing work because of a lack of workers. Therefore, the Hungarian method is modified to resolve this condition, so that the total assignment cost can still be optimized.

Penerapan Metode Hungarian dalam Penugasan Dosen Pengampu Mata Kuliah Program Studi Matematika FMIPA Universitas Mataram

The tight schedule of lecture activities requires accuracy so that it always runs smoothly. Lecturer assignments play an important role to ensure the smooth lecture activities. Problems that often occur in the assignment of these lecturers need to be avoided. In an effort to reduce the risk of problems that occur in the assignment of lecturers, it is necessary to make a structured system with the right method. Hungarian method can be said very appropriate for this assignment problem because each course will only be charged to one lecturer. Another advantage of using the hungarian method in this lecturer assignment model is also because it uses the preferences of prospective lecturers as subjects of measurement. Each lecturer will take courses according to their best preferences with the expectation that the lecturer will have more mastery in the courses that he will teach.

Using Interval Operations in the Hungarian Method to Solve the Fuzzy Assignment Problem and Its Application in the Rehabilitation Problem of Valuable Buildings in Egypt

Assignment problem (AP) is an entrenched tool for solving engineering and management problems. The Hungarian method is always used to fathom the AP in crisp cases. This paper presents an algorithm of finding the optimum solution of the fuzzy AP by using the modified Hungarian method. This method is utilized to get a minimum assignment cost in the fuzzy environment for a fuzzy AP. Firstly, we use the fuzzy numbers without any transformation. Secondly, the fuzzy AP is transformed into an interval AP based on the α-cut methodology. Then, the interval arithmetic operations and the order relations are applied to get the optimal solution by utilizing the modified Hungarian method. The proposed algorithm requires less efforts and time to reach optimality, compared to the existing methods. Numerical examples are given to ensure the efficiency and the validity of the proposed algorithm. A study on the reuse of many valuable buildings is presented after using different government and service buildings in a manner that does not fit with its original function and heritage value. We offer a solution based on the scientific and realistic basis for requalification according to the variables and requirements of the social, cultural, and economic environments in the environment surrounding the valuable buildings.