scholarly journals Optimasi Penugasan Menggunakan Metode Hungarian

2017 ◽  
Vol 1 (2) ◽  
pp. 68
Author(s):  
Dwi Harini
Keyword(s):  
Linear Programming ◽  
Assignment Problem ◽  
Special Form ◽  
Delivery Time ◽  
Assignment Problems ◽  
Time Efficiency ◽  
Hungarian Method ◽  
Linear Programming Problems ◽  
A Company

  Assignment problems are a special form of linear programming problems that often occur in a company in allocating or placing a workforce that suits its ability. To solve the issue of assignment is to use Hungarian method. In applying the Hungarian method, the amount of labor assigned should be equal to the amount of work to be completed. The author uses Hungarian method to calculate the total delivery time of goods on CV. L & J Express Malang *) so as to get the optimal total delivery time. To solve the assignment problem on CV. L & J Express Malang, the required data includes employee name, destination location, and delivery time. Based on result of calculation using Hungarian method, obtained total delivery time of optimal goods equal to 105 minutes. Before using the Hungarian method the total delivery time of goods amounted to 119 minutes. It can be seen that there is a time efficiency of 14 minutes.

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

UNISTEK ◽  
2021 ◽  
Vol 8 (1) ◽  
pp. 41-46
Author(s):  
Yasir Arafat ◽  
Agustian Suseno
Keyword(s):  
Delivery Time ◽  
Food Sector ◽  
Time Efficiency ◽  
Hungarian Method ◽  
Product Delivery ◽  
A Company

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.

scholarly journals ANALISIS SENSIVITAS MODEL PENUGASAN DENGAN METODE HUNGARIAN

2021 ◽  
Vol 10 (1) ◽  
pp. 41
Author(s):  
ELFRIDA RIANI TSANI ◽  
NI KETUT TARI TASTRAWATI ◽  
KARTIKA SARI
Keyword(s):  
Sensitivity Analysis ◽  
Linear Programming ◽  
Assignment Problem ◽  
Optimal Solution ◽  
Working Time ◽  
Optimal Decision ◽  
Optimal Decisions ◽  
Hungarian Method

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.

The PSK Method for Solving Fully Intuitionistic Fuzzy Assignment Problems With Some Software Tools

2020 ◽  
pp. 149-202 ◽  
Author(s):  
P. Senthil Kumar
Keyword(s):  
Linear Programming ◽  
Comparative Study ◽  
Assignment Problem ◽  
Linear Programming Problem ◽  
Real Life ◽  
Computer Code ◽  
Assignment Problems ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Environment ◽  
Software Packages

The assignment problem (AP) is a particular case of a linear programming problem that deals with the allocation of various resources for various activities on a 1-to-1 basis. It does so in such a manner that the profit or sale involved in the process is maximum and cost or time is minimum. Generally, the profit/sale/cost/time is called the parameter of the AP and this is not a crisp number due to some uncontrollable factors. They can also involve uncertainty and hesitation. Therefore, to solve the AP under an intuitionistic fuzzy environment in this chapter, the author proposes the PSK (P. Senthil Kumar) method. Numerous theorems which are related to intuitionistic fuzzy assignment problem is proposed and is proved by PSK. By using the PSK method, the real-life related fully intuitionistic fuzzy assignment problems are solved. The proposed results are verified by both LINGO 17.0 and TORA software packages. In addition to verifying the efficiency and realism of the proposed method, the computer code based on LINGO 17.0 is presented. Results, discussion, comparative study, and the advantages of the PSK method are given. The chapter ends with the conclusion and future studies.

scholarly journals OPTIMALISASI MASALAH PENUGASAN TIDAK SEIMBANG MENGGUNAKAN MODIFIED HUNGARIAN METHOD

2021 ◽  
Vol 10 (1) ◽  
pp. 26
Author(s):  
RENALDO EVIPANIA ◽  
G.K. GANDHIADI ◽  
I WAYAN SUMARJAYA
Keyword(s):  
Linear Programming ◽  
Assignment Problem ◽  
Real Life ◽  
Dummy Variable ◽  
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.

International Conference on Advancements in Technology, Business and Management Implementation of Assignment Model in Distributing Computer System

2019 ◽  
Vol 118 (4) ◽  
pp. 153-159
Author(s):  
S. Maheshwari ◽  
S. Iyyappan ◽  
M. Nirmala
Keyword(s):  
Mathematical Model ◽  
Computer System ◽  
Assignment Problem ◽  
Optimal Decision ◽  
International Conference ◽  
Assignment Model ◽  
Maximum Profit ◽  
Hungarian Method ◽  
A Company ◽  
Business And Management

This paper presents a mathematical model for distributing computers in the IT sector. The model is to find the maximum profit of a company who gives computers as rentals for various vendors. Assignment problem is implemented for assigning various computers to vendors. The solution of the assignment problem is obtained by Hungarian method. Based on this solution, the company made the optimal decision in distribution of computers to various vendors.

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

2021 ◽  
Vol 6 (3) ◽  
Author(s):  
Lutfi Nur Rahman ◽  
Wahyudin Wahyudin
Keyword(s):  
Service Provider ◽  
Completion Time ◽  
Service Industry ◽  
Delivery Time ◽  
Time Efficiency ◽  
Hungarian Method ◽  
Long Time ◽  
Freight Forwarding

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.

Sign in / Sign up

Export Citation Format

Share Document