The Reduction of Directed Cyclic Graph for Task Assignment Problem
In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists. Therefore, an effort should be done in order to eliminate the cycle to obtain a directed acyclic graph (DAG), so that th...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2018-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201815006031 |
| id |
doaj-52e25ca84cfe4da2acdac88943c65ab4 |
|---|---|
| record_format |
Article |
| spelling |
doaj-52e25ca84cfe4da2acdac88943c65ab42021-02-02T09:21:47ZengEDP SciencesMATEC Web of Conferences2261-236X2018-01-011500603110.1051/matecconf/201815006031matecconf_mucet2018_06031The Reduction of Directed Cyclic Graph for Task Assignment ProblemAriffin W.N.M.In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists. Therefore, an effort should be done in order to eliminate the cycle to obtain a directed acyclic graph (DAG), so that the minimum amount of time required for the entire task can be found. The technique of reducing the complexity of the directed cyclic graph to a directed acyclic graph by reversing the orientation of the path is the main contribution of this study. The algorithm was coded using Java programming and consistently produced good assignment and task schedule.https://doi.org/10.1051/matecconf/201815006031 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Ariffin W.N.M. |
| spellingShingle |
Ariffin W.N.M. The Reduction of Directed Cyclic Graph for Task Assignment Problem MATEC Web of Conferences |
| author_facet |
Ariffin W.N.M. |
| author_sort |
Ariffin W.N.M. |
| title |
The Reduction of Directed Cyclic Graph for Task Assignment Problem |
| title_short |
The Reduction of Directed Cyclic Graph for Task Assignment Problem |
| title_full |
The Reduction of Directed Cyclic Graph for Task Assignment Problem |
| title_fullStr |
The Reduction of Directed Cyclic Graph for Task Assignment Problem |
| title_full_unstemmed |
The Reduction of Directed Cyclic Graph for Task Assignment Problem |
| title_sort |
reduction of directed cyclic graph for task assignment problem |
| publisher |
EDP Sciences |
| series |
MATEC Web of Conferences |
| issn |
2261-236X |
| publishDate |
2018-01-01 |
| description |
In this paper, a directed cyclic graph (DCG) is proposed as the task graph. It is undesirable and impossible to complete the task according to the constraints if the cycle exists. Therefore, an effort should be done in order to eliminate the cycle to obtain a directed acyclic graph (DAG), so that the minimum amount of time required for the entire task can be found. The technique of reducing the complexity of the directed cyclic graph to a directed acyclic graph by reversing the orientation of the path is the main contribution of this study. The algorithm was coded using Java programming and consistently produced good assignment and task schedule. |
| url |
https://doi.org/10.1051/matecconf/201815006031 |
| work_keys_str_mv |
AT ariffinwnm thereductionofdirectedcyclicgraphfortaskassignmentproblem AT ariffinwnm reductionofdirectedcyclicgraphfortaskassignmentproblem |
| _version_ |
1724295191804772352 |