%0 Journal Article
%T Using Genetic Algorithms for Parallel Machines Multi-Objective Scheduling Problems with Families and One Resource Constrained<br>一种求解带资源约束的并行机器多目标调度问题的遗传算法
%A ZENG Xiang-ge
%A HAN Bo-tang
%A <br>曾相戈
%A 韩伯棠
%J 系统工程理论与实践
%D 2005
%I 
%X Multi-objective scheduling on parallel machines with families and one resource constrained is considered. The objectives are total tardiness and maximum make-span. This paper proposes genetic algorithms using tournament selection, niche count, and violation degree to solve this problem. The computational results from random orders show that the genetic algorithms are more efficient than rectified EDD,LPT, and SPT in solving the problem.
%K multi-objective
%K constraint
%K parallel machines
%K genetic algorithms<br>多目标
%K 约束
%K 并行机器
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=AF477112EB1BA6B6&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=9CF7A0430CBB2DFD&sid=46CB27789995047D&eid=0D0D661F0B316AD5&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=13