论文部分内容阅读
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 d