期刊文献+

一种求解多目标资源受限项目调度的遗传算法 被引量:9

Genetic algorithm for multi-objective resource-constrained project scheduling problem.
下载PDF
导出
摘要 采用基于非支配性排序的多目标遗传算法—NSGA-Ⅱ,设计了一种求解多模式、多种类资源约束的多目标资源受限项目调度问题的遗传算法,该算法所设计的编码包含两部分,一部分为一个任务链表,另一部分为任务链表中各任务所对应的执行模式组成的模式向量。将所设计的算法用于求解文献中的以项目总工期和资源均衡为目标的农业项目调度问题,结果表明此算法对于求解多目标资源受限项目调度问题是有效的。 This paper proposed a multi-objective evolutionary algorithm called the Fast Elitist Non-Dominated Sorting Genetic Algorithm (NSGA-Ⅱ) to solve resource-constrained project scheduling problem with multiple activity performance modes and two objectives to minimize project makespan and resource utilization smoothness.The solution is represented by a precedence feasible activity list and a mode assignment.An agricultural example with two objectives is used to test the performance of algorithm proposed.The results show that the algorithm proposed by us is efficient for solving the multi-objective resource-constrained project scheduling problem.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第7期1-4,12,共5页 Computer Engineering and Applications
基金 国家自然科学基金(the NationalNatural Science Foundation of Chinaunder Grant No.70571057,No.70301005)
关键词 资源受限 项目调度 多目标 遗传算法 resource constrained project scheduling multi-objective genetic algorithm
  • 相关文献

参考文献8

  • 1Demeulemeester E L,Herroelen W S.Project scheduling:a research handbook[M].Boston,London:Kluwer Academic Publishers,2002.
  • 2Slowinski R.Multiobjective project scheduling under multiple-category resource constraints,in:advances in project scheduling[M].Amsterdam: Elsevier, 1989.
  • 3Slowinski R,Soniewicki B,and Weglarz J.DSS for multiobjective project scheduling[J].European Journal of Operational Research, 1994,79: 220-229.
  • 4Hapke M,Jaszkiewicz A,Slowinski R.Interactive analysis of multicriteria project scheduling problem[J].European Journal of Operational Research, 1998,107 : 315-324.
  • 5Viana A,Sousa J P.Using metaheuristics in multi-objective resource constrained project scheduling[J].European Journal of Operational Research, 2000,120: 359-374.
  • 6Coello Coello C A,Van Veldhuizen D A,Lamont G B.Evolutionary algorithms for solving multi-objective problems[M].Boston:London, Kluwer Academic Publishers, 2002.
  • 7Deb K,Agrawal S,Pratap A.A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization:NSGA- Ⅱ ,KanGal Report 200001[R].Kanpur,India:Indian institute of technology,2000.
  • 8Kolisch R.Serial and parallel resource-constrained project scheduling methods revisited:theory and computation[J].European Journal of Operational Research, 1996,90:320-333.

同被引文献96

  • 1徐长盛,谢立.关键路径算法的面向对象解决[J].计算机应用研究,2005,22(4):96-97. 被引量:5
  • 2姚金涛,林亚平,张明武,童调生.一种基于决策图贝叶斯网络的强度Pareto进化算法[J].计算机学报,2005,28(12):1993-1999. 被引量:7
  • 3王宏,林丹,李敏强.一种求解资源受限项目调度问题的自适应遗传算法[J].系统工程,2005,23(12):99-102. 被引量:9
  • 4王巍,赵国杰.粒子群优化在资源受限工程调度问题中的应用[J].哈尔滨工业大学学报,2007,39(4):669-672. 被引量:11
  • 5SLOWINSKI R. Multiobjective network scheduling with effi- cient use of renewable and nonrenewable resources[J]. Euro- pean Journal of Operational Research, 1981,7 (3) : 265-273.
  • 6SLOWINSKI R, SONIEWICLU B, WEGLARZ J. DSS for multiobjective project scheduling[J]. European Journal of Op- erational Research, 1994,79 (2) : 220-229.
  • 7HAPKE M, JASZKIEWICZ A, SLOWINSKI R. Fuzzy multi- mode project scheduling with multiple ob- jectives[M]//Project Seheduling-Recent Models, Algorithms and Applications. Amsterdam, the Netherlands: Kluwer Aca- demic Publishers, 1998: 355-382.
  • 8HAPKE M, JASZKIEWICZ A, SLOWINSKI R. Pareto sim- ulated annealing for fuzzy multi-objective combinatorial optimi- zation[J]. Journal of Heuristics,2000,6(3) :329-345.
  • 9HAPKE M, SLOWINSKI IL Fuzzy set approach to multi-ob- jective and multi-mode project scheduling under uncertainty [M]// Scheduling Under Fuzziness. Heidelberg, Germany.. Physica Verlag, 2000:197-221.
  • 10HAPKE M, JASZKIEWICZ A, SLOWINSKI tL Interactive analysis of multiple-criteria project scheduling problems [J]. European Journal of Operational Research, 1998, 107 (2) : 315-324.

引证文献9

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部