An Improved Hungarian Algorithm for a Special Case of Unbalanced Assignment Problems
Abstract
The current Hungarian approach to solving unbalanced assignment issues is based on the notion that some tasks should be delegated to fictitious or covert components, and those studies should be left unperformed. In real-world scenarios, it may be desirable to carry out all of the tasks on fundamental details. To do this, multiple tasks may be distributed to a single machine. The current research's enhanced Hungarian method for addressing unbalanced assignment challenges results in the ideal work assignment policy. An example using numbers shows how well the suggested strategy works and how effective it is. The acquired result is then likened to other current approaches to demonstrate our algorithm's superiority.
Downloads
How to Cite
References
H Kuhn (1955) The Hungarian method for the assignment problem. 2(1-2), 83-97.
B Li, J Xu, W Du (2002) A simulated annealing algorithm for an assignment problem withprecedence relation among the elements. 4.
Li Tingpeng, Li Yue, Qian Yanling (2016) Improved Hungarian algorithm for assignment problems of serial-parallel systems. 27(4), 858-870.
W Yao (2014) Information technology and computer application engineering.
W Tan, Q Zhao, S Yu, R Xiao (2007) Solving task assignment problem based on improved particle swarm optimization algorithm. 27(12), 2892-2895.
M Liu, Y Peng (2013) Achieving the Dispatching of Group Control Stereoscopic Garage Based on the Ant Colony Algorithm. 439-443.
T Li, Y Li, Y Qian (2016) Improved Hungarian algorithm for assignment problems of serial-parallel systems. 27(4), 858-870.
L Huang, P Xu, Q Wang (2007) Firepower distribution problems based on Hungarian method. 32(6), 25-28.
T Chang, Z Han (2004) Solution to a classic optimization problem by utilizing the Hungary calculate way. 5(1), 60-62.
X Ma (2014) A new algorithm for assignment problems with 'tasks more than the number of persons. 31(12), 68-71.
J Ren, F He (2014) Task assignment model in cloud computing based on hungary algorithm of faster reduced order. 35(3), 63-67.
Fulin Yang, Tingting Li, Yuxi Lin, Xiangshang Wang, Yuxuan Min, Qidong Yang, Zikang Sun, Dongxue Li (2014) Construction and Mechanism Study of Z-scheme BiVO4/ WO3 Photoelectrodes Based on Anodized Tungsten Oxide Foils. 1(1), 1-21.
Peter Hahn, Thomas Grant, Nat Hall (1998) A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. 108(3), 629-640.
H Kuhn (2012) A tale of three eras: The discovery and rediscovery of the Hungarian Method. 219(3), 641-651.
E Loiola, N Maia, P Oswaldo (2007) A survey forthe quadratic assignment problem. (176), 657-690.
Jacob Goldberger, Tamir Tassa (2008) A hierarchical clustering algorithm based on the Hungarian method. 29(11), 1632-1638.
Yi-Ping Phoebe Chen, Supawan Promparmote, Frederic Maire (2006) MDSM: Microarray database schema matching using the Hungarian method. 176(19), 2771-2790.
P Dütting, M Henzinger, I Weber (2013) Sponsored search, market equilibria, and the Hungarian Method. 113(3), 67-73.
A Kumar (2006) A modified method for solving the unbalanced assignment problems. 176(1), 76-82.
V Yadaiah, V Haragopal (2016) A new approach of solving single objective unbalanced assignment problem. 6(01), 81.
Nathan Betts, Francis Vasko (2016) Solving the Unbalanced Assignment Problem: Simpler Is Better. 06(04), 296-299.
Published
2022-11-01
Issue
Section
License
Copyright (c) 2022 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.