Journal of Systems Engineering and Electronics ›› 2009, Vol. 20 ›› Issue (6): 1336-1343.
• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles Next Articles
Yi Yang & Lai Jieling
Online:
Published:
Abstract:
Scheduling jobs on parallel machines to minimize the total tardiness (p//T) is proved to be NP hard. A new ant colony algorithm to deal with p//T (p//T ACO) is addressed, and the computing model of mapping p//T to the ant colony optimization environment is designed. Besides, based on the academic researches on p//T, some new properties used in the evolutionary computation are analyzed and proved. The theoretical analysis and comparative experiments demonstrate that p//T ACO has much better performance and can be used to solve practical large scale problems efficiently.
Yi Yang & Lai Jieling. Computation model and improved ACO algorithm for p//T?[J]. Journal of Systems Engineering and Electronics, 2009, 20(6): 1336-1343.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jseepub.com/EN/
https://www.jseepub.com/EN/Y2009/V20/I6/1336