DocumentCode
1952657
Title
Notice of Retraction
A modified delayed-start LPT algorithm for the sum of squares of machine completion times minimization problem on two parallel machines
Author
Cunchang Gug ; Yundong Mu
Author_Institution
Coll. of Sci., Henan Univ. of Technol., Zhengzhou, China
Volume
4
fYear
2010
fDate
9-11 July 2010
Firstpage
303
Lastpage
306
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.
We consider an off-line modified delayed-start LPT algorithm that optimally schedules the first longest 7 jobs and the remaining jobs according to the LPT rule on two identical parallel machines. We show that this algorithm has a sharper tight worst-case ratio bound 1+1/81 than the traditional LPT algorithm for the sum of squares of machine completion times minimization problem.
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.
We consider an off-line modified delayed-start LPT algorithm that optimally schedules the first longest 7 jobs and the remaining jobs according to the LPT rule on two identical parallel machines. We show that this algorithm has a sharper tight worst-case ratio bound 1+1/81 than the traditional LPT algorithm for the sum of squares of machine completion times minimization problem.
Keywords
computational complexity; minimisation; scheduling; machine completion times minimization problem; off-line modified delayed-start LPT algorithm; parallel machines; sum of squares; approximation algorithm; parallel machines; scheduling; the sum of squares of machine completion times;
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.5564766
Filename
5564766
Link To Document