### A Fast Dynamic Assignment Algorithm for Solving Resource Allocation Problems

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

H. Wang, D. Shi, and B. Song, “A dynamic role assignment formation control algorithm based on hungarian method,” in 2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovations, 2018, pp. 687–696.

S. Ding and X. J. Zeng, “Uncertain random assignment problem,” Appl. Math. Model., Vol. 56, pp. 96–104, 2018.

P. Kaur, A. Sharma, V. Verma, and K. Dahiya, “A priority based assignment problem,” Appl. Math. Model., Vol. 40, No. 17–18, pp. 7784–7795, 2016.

T. Li, Y. Li, and Y. Qian, “Improved Hungarian algorithm for assignment problems of serial-parallel systems,” J. Syst. Eng. Electron., Vol. 27, No. 4, pp. 858–870, 2016.

F. F. Pashchenko, N. A. Kuznetsov, N. G. Ryabykh, I. K. Minashina, E. M. Zakharova, and O. A. Tsvetkova, “Implementation of train scheduling system in rail transport using assignment problem solution,” in 6th International Conference on Emerging Ubiquitous Systems and Pervasive Networks, EUSPN-2015, 2015, Vol. 63, pp. 154–158.

T. Öncan, Z. Şuvak, M. H. Akyüz, and K. Altınel, “Assignment problem with conflicts,” Comput. Oper. Res., Vol. 111, pp. 214–229, 2019.

I. H. Toroslu and Y. Arslanoglu, “Genetic algorithm for the personnel assignment problem with multiple objectives,” Inf. Sci. (Ny)., Vol. 177, No. 3, pp. 787–803, 2007.

S. Lan, W. Fan, T. Liu, and S. Yang, “A hybrid SCA–VNS meta-heuristic based on Iterated Hungarian algorithm for physicians and medical staff scheduling problem in outpatient department of large hospitals with multiple branches,” Appl. Soft Comput. J., Vol. 85, p. 105813, 2019.

M. Ratli, A. A. El Cadi, B. Jarboui, and A. Artiba, “Dynamic assignment problem of parking slots,” Proc. 2019 Int. Conf. Ind. Eng. Syst. Manag. IESM 2019, pp. 1–6, 2019.

S. Chopra, G. Notarstefano, M. Rice, and M. Egerstedt, “A Distributed Version of the Hungarian Method for Multirobot Assignment,” IEEE Trans. Robot., Vol. 33, No. 4, pp. 932–947, 2017.

S. Marangoz, M. F. Amasyalı, E. Uslu, F. Çakmak, N. Altuntaş, and S. Yavuz, “More scalable solution for multi-robot–multi-target assignment problem,” Rob. Auton. Syst., Vol. 113, pp. 174–185, 2019.

R. R. Patel, T. T. Desai, and S. J. Patel, “Scheduling of jobs based on Hungarian method in cloud computing,” in 2017 International Conference on Inventive Communication and Computational Technologies (ICICCT), 2017, pp. 6–9.

A. Kline, D. Ahner, and R. Hill, “The Weapon-Target Assignment Problem,” Comput. Oper. Res., Vol. 105, pp. 226–236, 2019.

C. Leboucher et al., “Novel evolutionary game based multi-objective optimisation for dynamic weapon target assignment,” in Proceedings of the 19th World Congress The International Federation of Automatic Control, 2014, Vol. 47, No. 3, pp. 3936–3941.

A. Iampang, V. Boonjing, and P. Chanvarasuth, “A cost and space efficient method for unbalanced assignment problems,” in 2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010, pp. 985–988.

R. V. Vinchoo, Mohit Manoj; Deolekar, “Comparative analysis of different approaches to solve the job assignment problem,” in 2017 International Conference on Trends in Electronics and Informatics (ICEI), 2017, pp. 129–134.

Q. Rabbani, A. Khan, and A. Quddoos, “Modified Hungarian method for unbalanced assignment problem with multiple jobs,” Appl. Math. Comput., Vol. 361, pp. 493–498, 2019.

H. A. Taha, Operations Research an Introduction Eighth Edition. United States of America: Pearson Education, 2007.

D. Gurukumaresan, C. Duraisamy, R. Srinivasan, and V. Vijayan, “Optimal solution of fuzzy assignment problem with centroid methods,” Mater. Today Proc., pp. 5–7, 2020.

A. Niv, M. MacCaig, and S. Sergeev, “Optimal assignments with supervisions,” Linear Algebra Appl., Vol. 595, pp. 72–100, 2020.

J. A. . Bondy and U. S. R. . Murty, Graph Theory, 3rd edition. Berlin, Germany: Springer, 2008.

D. Jungnickel, Graphs, Networks and Algorithms, 4th edition. New York: Springer Heidelberg, 2012.

SPOJ, “Dynamic Assignment Problem,” 2012. http://www.spoj.com/problems/DAP/ (accessed Aug. 23, 2020).

E. Malaguti and R. Medina Durán, “Computing k different solutions to the assignment problem,” Comput. Ind. Eng., Vol. 135, pp. 528–536, 2019.

K. Date and R. Nagi, “GPU-accelerated Hungarian algorithms for the Linear Assignment Problem,” Parallel Comput., Vol. 57, pp. 52–72, 2016.

#### Article Statistics

Abstract view : 173 timesPDF - 101 times

DOI: https://doi.org/10.15575/join.v6i1.692

### Refbacks

- There are currently no refbacks.

JOIN has been indexed by :

© All rights reserved 2016. Jurnal Online Informatika, p-ISSN: 2528-1682 | e-ISSN: 2527-9165

This work is licensed under a Creative Commons Attribution-NoDerivs 2.0 Generic License.