DocumentCode
2813262
Title
Notice of Retraction
Scheduling uniform parallel machines with machine eligibility restrictions to minimize total weighted tardiness
Author
Ying Guo ; Xinbao Liu
Author_Institution
Sch. of Manage., Hefei Univ. of Technol., Hefei, China
Volume
8
fYear
2010
fDate
22-24 Oct. 2010
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.
This paper considers the problem of scheduling uniform parallel machines with machine eligibility restrictions to minimize total weighted tardiness. We presented a new heuristic algorithm based local search on each machine for this problem. The experimental results have shown that the proposed heuristic was a very effective method for this problem in terms of solution quality, computational expense, coding complexity and algorithm stability, as seen through a comparison of 6 algorithms on various pairs of test data. Moreover, we observed that the proposed algorithm can be extended to the unrelated parallel machine setting.
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.
This paper considers the problem of scheduling uniform parallel machines with machine eligibility restrictions to minimize total weighted tardiness. We presented a new heuristic algorithm based local search on each machine for this problem. The experimental results have shown that the proposed heuristic was a very effective method for this problem in terms of solution quality, computational expense, coding complexity and algorithm stability, as seen through a comparison of 6 algorithms on various pairs of test data. Moreover, we observed that the proposed algorithm can be extended to the unrelated parallel machine setting.
Keywords
minimisation; parallel machines; single machine scheduling; algorithm stability; coding complexity; computational expense; heuristic algorithm; machine eligibility restrictions; solution quality; total weighted tardiness minimization; uniform parallel machine scheduling; Gold; Parallel machines; Processor scheduling; heuristic; machine eligibility; scheduling; total weighted tardiness; uniform parallel machine;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location
Taiyuan
Print_ISBN
978-1-4244-7235-2
Type
conf
DOI
10.1109/ICCASM.2010.5619252
Filename
5619252
Link To Document