التخص صٌ الأمثل للمهام على الموارد المتاحة
Article Sidebar
Main Article Content
Abstract
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
Mills-Tettey, et al., (2007). The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs, Robotics Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213.
Goldengorin, B., & Jäger, G. (2008). The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Pro. Algorithmic Operations Research, 3(1), University of Halle-Wittenberg D-06099 Halle (Saale), Germany.
Kuhn, H. W. (2010). The Hungarian Method for the Assignment Problem. In 50 Years of Integer Programming 1958-2008 (pp. 29-47). Springer Berlin Heidelberg. DOI: https://doi.org/10.1007/978-3-540-68279-0_2
Nizami, S. T., et al. (2011). A New for Finding the Cost of Assignment Problem Using Genetic Algorithm of Artificial Intelligence. IJLTC Board Members, 135. [9] Basirzadeh, H. (2012). Ones Assignment Method for Solving Assignment Problems. Applied Mathematical Sciences, Shahid Chamran University, Ahvaz, Iran, 6(47),2345-2355. [10] Srinivasan, A., & Geetharamani, G. (2013). Method for Solving Fuzzy Assignment Problem. Applied Mathematical Sciences, 7(113), 5607-5619. [11] Khalid, M., Sultana, M., & Zaidi, F. (2014). New Improved Ones Assignment Method. Applied Mathematical Sciences, Federal Urdu University, Karachi-75300, Pakistan, 8(84), 4171-4177.
Ghadle, K., &Muley, Y., (2015), Hybridization of One’s Assignment and Stepping Stone Method, Department of Mathematics, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad -431004 (INDIA).