DocumentCode
1940426
Title
Notice of Retraction
An improved tabu optimization approach for workflow scheduling
Author
Zhan Xu ; Gang Wu ; Jinlin Wang ; Lei Liu
Author_Institution
Key Lab. of Network Commun. Syst. & Control, USTC, Hefei, China
Volume
5
fYear
2010
fDate
9-11 July 2010
Firstpage
398
Lastpage
401
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Directed Acyclic Graph (DAG) is a nature way of workflow description. One of the most important and challenging problems in the DAG workflow field is the QoS-constrained scheduling problem with the aim to minimize the cost. This paper proposes a new algorithm to tackle this problem. The algorithm proposed is based on tabu search and make some improvements. Subject to the deadline of the workflow, this algorithm has a lower execution cost than other existing algorithms. Simulation results prove the effectiveness and feasibility of the algorithm.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Directed Acyclic Graph (DAG) is a nature way of workflow description. One of the most important and challenging problems in the DAG workflow field is the QoS-constrained scheduling problem with the aim to minimize the cost. This paper proposes a new algorithm to tackle this problem. The algorithm proposed is based on tabu search and make some improvements. Subject to the deadline of the workflow, this algorithm has a lower execution cost than other existing algorithms. Simulation results prove the effectiveness and feasibility of the algorithm.
Keywords
directed graphs; minimisation; scheduling; search problems; QoS constrained scheduling problem; cost minimization; directed acyclic graph; improved tabu optimization approach; tabu search; workflow scheduling; Europe; QoS-constrained; directed acyclic graph; tabu search; workflow scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-5537-9
Type
conf
DOI
10.1109/ICCSIT.2010.5564090
Filename
5564090
Link To Document