Treffer: Transformation of DCG onto DAG for task assignment problem.

Task assignment is one of the most challenging problems in distributed computing environment and many real-life problems. Several approaches and techniques of optimal task assignment have been proposed by various researchers ranging from graph partitioning-based tools to heuristic graph matching. A good task assignment algorithm and mapping strategy ensure completion time minimization. However, if a cycle exists, it is undesirable and impossible to complete the task according to the constraints. Thus, it is desirable to have a method to eliminate the cycle to obtain a directed acyclic graph for a task assignment problem. In this paper, the technique of transforming a directed cyclic graph formed by a plurality of nodes into a directed acyclic graph are presented. The algorithm was coded, and the simulations are run for the proposed model using respective program developed by JavaScript programming language with D3 library. Based on the results, the proposed models give better optimality index by 6.80% compared to previous works. This research provides fundamental solution and better understanding to avoid cycle on assignment problems thus helping organizations or companies to increase the efficiency in planning as well as reducing the routing cost. [ABSTRACT FROM AUTHOR]

Copyright of AIP Conference Proceedings is the property of American Institute of Physics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)