Improved Hungarian Algorithm for Unbalanced Assignment Problems

2017 ◽  
Author(s):  
Tri Tri Hernawati

. Every company both in the field of service and manufacturing always trying to pass efficiency of it’s resource use. One resource that has an important role is labor. Labor has different efficiency levels for different jobs anyway. Problems related to the optimal allocation of labor that has different levels of efficiency for different jobs are called assignment problems, which is a special case of linear programming. In this research, Analysis of Labor Employment Assesment on Production Machine to Minimize Time Production, in PT PDM is done by using Hungarian algorithm. The aim of the research is to get the assignment of optimal labor on production machine to minimize time production. The results showed that the assignment of existing labor is not suitable because the time of completion of the assignment is longer than the assignment by using the Hungarian algorithm. By applying the Hungarian algorithm obtained time savings of 16%.


2017 ◽  
Author(s):  
Tri Tri Hernawati

Abstract. Every company both in the field of service and manufacturing always trying to pass efficiency of it’s resource use. One resource that has an important role is labor. Labor has different efficiency levels for different jobs anyway. Problems related to the optimal allocation of labor that has different levels of efficiency for different jobs are called assignment problems, which is a special case of linear programming. In this research, Analysis of Labor Employment Assesment on Production Machine to Minimize Time Production, in PT PDM is done by using Hungarian algorithm. The aim of the research is to get the assignment of optimal labor on production machine to minimize time production. The results showed that the assignment of existing labor is not suitable because the time of completion of the assignment is longer than the assignment by using the Hungarian algorithm. By applying the Hungarian algorithm obtained time savings of 16%.


2021 ◽  
Vol 183 (2) ◽  
Author(s):  
D. Benedetto ◽  
E. Caglioti ◽  
S. Caracciolo ◽  
M. D’Achille ◽  
G. Sicuro ◽  
...  

AbstractWe consider the assignment problem between two sets of N random points on a smooth, two-dimensional manifold $$\Omega $$ Ω of unit area. It is known that the average cost scales as $$E_{\Omega }(N)\sim {1}/{2\pi }\ln N$$ E Ω ( N ) ∼ 1 / 2 π ln N with a correction that is at most of order $$\sqrt{\ln N\ln \ln N}$$ ln N ln ln N . In this paper, we show that, within the linearization approximation of the field-theoretical formulation of the problem, the first $$\Omega $$ Ω -dependent correction is on the constant term, and can be exactly computed from the spectrum of the Laplace–Beltrami operator on $$\Omega $$ Ω . We perform the explicit calculation of this constant for various families of surfaces, and compare our predictions with extensive numerics.


2020 ◽  
Author(s):  
Irina Zaitseva ◽  
Oleg Malafeyev ◽  
Ekaterina Konopko ◽  
Viktoriya Taran ◽  
Anna Durakova

Sign in / Sign up

Export Citation Format

Share Document