An amalgamated approach for solving unbalanced assignment problem
Gespeichert in:
| Titel: | An amalgamated approach for solving unbalanced assignment problem |
|---|---|
| Autoren: | Anju Khandelwal |
| Quelle: | Malaya Journal of Matematik; Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM); 321-325 ; 2321-5666 ; 2319-3786 |
| Verlagsinformationen: | MKD Publishing House |
| Publikationsjahr: | 2018 |
| Schlagwörter: | Unbalanced Assignment, Partial Bound Value, Hungarian Method, Distributed computing System, Mathematics |
| Beschreibung: | Task assignment to any computing system is a most interesting and demandable research problem. Various methodologies and techniques are available in the literature to provide the solution of such problems. The assignment problems in distributed computing systems are one of major factor to determine the performance of such systems. The Assignment problem is one of the main problems while assigning jobs to the worker or machines to the worker to get an optimal solution. The problem mentioned in this paper suggests an exhaustive search approach to the unbalanced assignment problem through partial bound optimization. The bound is based on partial bound values. This paper contains the devised technique, computational algorithm of the approach and its implementation. This study is capable to deal all such real life situations where the Jobs (tasks) are more than the number of Machine (processors). The obtain solution is under consideration that all the jobs are allotted on the available machines in an optimum way. Finally numerical example and its algorithm have been given to show the efficiency of the proposed techniques. |
| Publikationsart: | article in journal/newspaper |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| Relation: | https://www.malayajournal.org/index.php/mjm/article/view/815/539; https://www.malayajournal.org/index.php/mjm/article/view/815 |
| DOI: | 10.26637/MJM0602/0003 |
| Verfügbarkeit: | https://www.malayajournal.org/index.php/mjm/article/view/815 https://doi.org/10.26637/MJM0602/0003 |
| Rights: | Copyright (c) 2018 MJM ; https://creativecommons.org/licenses/by/4.0/ |
| Dokumentencode: | edsbas.AFF2B5F0 |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Task assignment to any computing system is a most interesting and demandable research problem. Various methodologies and techniques are available in the literature to provide the solution of such problems. The assignment problems in distributed computing systems are one of major factor to determine the performance of such systems. The Assignment problem is one of the main problems while assigning jobs to the worker or machines to the worker to get an optimal solution. The problem mentioned in this paper suggests an exhaustive search approach to the unbalanced assignment problem through partial bound optimization. The bound is based on partial bound values. This paper contains the devised technique, computational algorithm of the approach and its implementation. This study is capable to deal all such real life situations where the Jobs (tasks) are more than the number of Machine (processors). The obtain solution is under consideration that all the jobs are allotted on the available machines in an optimum way. Finally numerical example and its algorithm have been given to show the efficiency of the proposed techniques. |
|---|---|
| DOI: | 10.26637/MJM0602/0003 |