摘要
本文以装甲车辆传动装置设计为例,研究产品设计资源受限项目调度规划方法和优化调度问题求解算法。美国航空航天局NASA在2009年8月的科学技术报告中指出,研究资源受限项目调度问题(RCPSP)对于带工期、人力和设备约束的军工产品研制具有重要意义。本文问题在理论上属于NP-hard问题,具有理论和应用价值。
本文针对某科研所委托“传动装置设计项目调度系统”项目的工程实际需求,在国家自然科学基金资助下,以传动装置设计为例,提出一种产品设计流程调度规划方法,给出设计资源受限项目优化调度问题的两种求解算法,以最终实现工程实用为目的。本文主要工作如下：
(1)提出一种基于工程语义网-设计结构矩阵(简称ESW-DSM)的设计流程规划方法。在产品结构树基础上,基于工程语义,构建产品结构、任务和设计团队(有限资源)工程语义网,进而基于DSM给出设计流程规划,最后根据设计团队有限资源,给出该受限项目调度规划方案。最后,以该传动装置的设计流程调度规划实例对本文方法进行了验证。
(2)提出一种基于群智能的散射搜索算法(简称SISS),利用带偏好的最大最小蚂蚁算法为散射搜索法提供多样性解,避免早熟。同时引入向前向后改进法,对当前最优解进行局部搜索,使算法快速收敛,用于求解单模式资源受限项目优化调度问题。分别通过单模式RCPSP问题集PSPLIB和装甲车辆传动装置设计实例问题求解验证,表明SISS算法可以快速收敛到工程满意解,提高计算效率。
(3)给出一种带分布估计的广义差异演化算法(简称GDE-EDA),基于广义差异演化算法(GDE),利用分布估计算法(EDA)分析问题解空间的全局信息和设计变量间的内在联系,对最优解的分布进行预测,指导全局搜索过程,可以更快的获得多样性更好的Pareto解集,用于求解多目标多模式设计资源受限项目优化调度问题。经标准多目标测试函数(考题)与实例数值仿真实验表明,本文算法与NSGA-Ⅱ(非支配排序遗传算法)和GDE3广义差异演化算法)相比,具有较好的收敛性和多样性。(4)在上述研究成果的基础上,基于工作流技术研制了传动装置设计项目调度原型系统(TDPS)。综上所述,本文以装甲车辆传动装置设计为应用背景,在理论上,给出了一种产品设计资源受限项目调度规划方法(ESW-DSM)和优化调度问题求解的两种算法(SISS和GDE-EDA),并研制了该传动装置设计项目调度原型系统(TDPS),可望推广应用于工程车辆或工程机械产品设计。
Taking transmission design of armored vehicles as an example, this dissertation does research on Resource-Constrained Project Scheduling Problem (RCPSP) for product design and the solving algorithms. In the scientific and technical reports presented in August 2009, NASA points out that research of RCPSP problem is important for the military product development with band schedules, manpower and equipment constraints. This problem is a NP-hard problem in theory, which has theoretical and practical value.
To satisfy the actual engineering requirement of "transmission design project scheduling system" project commissioned by a research institute, the dissertation explores a planning and scheduling method for product design, and proposes two solving algorithms for project scheduling problem with constrained resource. Our research is supported by the National Natural Science Foundation. Our contribution is as follows:
(1) We present a planning method for design process based on Engineering Semantic Web-Design Structure Matrix (ESW-DSM). According to product structure tree, we utilize engineering semantic to construct engineering semantic web of product structure, task and design team with constrained resource. Then we give design process planning on the basis of DSM and we give the constrained project scheduling plan according to the constrained resource of the design team. Finally, the proposed method is verified by the design process planning of a transmission.
(2) We propose a Swarm Intelligent based Scatter Search method (SISS). In the SISS, we make use of Biased MAX-MIN Ant System to provide diverse solutions for the scatter search method avoiding prematurity. We also introduce Forward-Backward Improvement (FBI) strategy to make the algorithm quickly converge by searching local optimal solution. The FBI strategy can used to solve Single-mode RCPSP optimization problem. Through verifying on Single-mode RCPSP problem set PSPLIB and the design problem of transmission of the armored vehicles, we find SISS algorithm can quickly converge to the project satisfactory solution and improve computation efficiency.
(3) We propose a Generalized Differential Evolution algorithm with Estimation of Distribution Algorithm (GDE-EDA). Based on generalized evolutionary algorithm, GDE-EDA utilizes the estimation of distribution algorithm to analyze the global information of the problem solution space and the intrinsic link between the design variables, predicts the distribution of the optimal solution and guides the global search process. The proposed method can faster obtain Pareto solution set of better diversity to solve the multi-mode multi-objective RCPSP optimization problem. Comparing the experimental results of with NSGA-II and GDE3 on multi-objective functions (benchmark) and actual example, the proposed algorithm has better convergence and diversity.
(4) According to the above research, we developed "transmission design project scheduling system (TDPS)" based on workflow technology.
Our work takes the transmission design of armored vehicles as application background. We give a ESW-DSM based complex product design process planning methods, propose two algorithms (SISS and GDE-EDA) for the scheduling of the product design; and develop transmission design project scheduling system (TDPS). Our work is expected to be applied to the design of engineering vehicles and engineering machinery product.
引文
[1]宗山.国外轮式装甲车辆发展展望[J].坦克装甲车辆,2002,(4).
[2]Collopy P. Value-driven Design[J]. Aerospace America,2008,46:12.
[3]郭峰,武建峰, 藩双夏, 等. 基于设计结构矩阵族的过程建模方法研究[J].浙江大学学报(工学版),2006,40(9)：1609-1613.
[4]Kolisch R, Sprecher A. PSPLIB-A project scheduling problem library:OR Software-ORSEP Operations Research Software Exchange Program[J]. European Journal of Operational Research, 1997,96(1):205-216.
[5]Dewit J, Herroelen W. An evaluation of microcomputer-based software packages for project-management[J]. European Journal of Operational Research,1990,49(1):102-139.
[6]Morton T, Pentico D. Heuristic scheduling systems:with applications to production systems and project management[M]. Wiley-Interscience,1993.
[7]熊光楞.并行工程的理论与实践[M].北京：清华大学出版社,施普林格出版社,2001.
[8]赵韩,武照云,宋晖,等.一种求解产品开发耦合任务依赖度的方法[J].中国机械工程,2009,20(7)：788=794.
[9]Browning T. Use of dependency structure matrices for product development cycle time reduction[A]. [C].Citeseer,1998.17
[10]Liu D, Wang J, Chan S, et al. Modeling workflow processes with colored Petri nets[J]. Computers in industry,2002,49(3):267-281.
[11]Steward D V. Design structure system:A method for managing the design of complex systems[J]. IEEE Transactions on Engineering Management 1981,28(3):71-74.
[12]Yan H S, Wang Z, Jiao X C. Modeling, scheduling and simulation of product development process by extended stochastic high-level evaluation Petri nets[J]. Robotics and Computer Integrated Manufacturing,2003,19(4):329-342.
[13]Zhao L, Jin Y. Modeling collaborative engineering design process using Petri-net[A]. [C].2000.
[14]Su J C Y, Chen S J G, Lin L. A structured approach to measuring functional dependency and sequencing of coupled tasks in engineering design* 1[J]. Computers & Industrial Engineering,2003, 45(1):195-214.
[15]Elmaghraby S E. Activity nets:A guided tour through some recent developments[J]. European Journal of Operational Research,1995,82(3):383-408.
[16]Mayer R, Menzel C, Painter M, et al. Information integration for concurrent engineering (IICE) IDEF3 process description capture method report[R].1997.
[17]Xu Q, Jiao J. Modeling the Design Process of Product Variants With Timed Colored Petri Nets[J]. Journal of Mechanical Design,2009,131:061009.
[18]Eppinger S. A planning method for integration of large-scale engineering systems[A]. [C].1997. 1199-204
[19]董明,程福安,查建中,等.并行设计过程的一种矩阵规划方法[J].天津大学学报,1997,30(4)：408-415.
[20]Xiao R, Chen T. Research on design structure matrix and its applications in product development and innovation:an overview[J]. International Journal of Computer Applications in Technology, 2010,37(3):218-229.
[21]Chen S J G, Lin L. Decomposition of interdependent task group for concurrent engineering* 1[J]. Computers & Industrial Engineering,2003,44(3):435-459.
[22]Chen L, Ding Z, Li S. Tree-based dependency analysis in decomposition and re-decomposition of complex design problems[J]. Journal of Mechanical Design,2005,127:12.
[23]Kusiak A, Wang J. Decomposition of the design process[J]. Journal of Mechanical Design,1993, 1115:687.
[24]Tang D, Zheng L, Li Z, et al. Re-engineering of the design process for concurrent engineering [J]. Computers & Industrial Engineering,2000,38(4):479-491.
[25]Smith R P,Eppinger S D.Identifying controlling features of engineering design iteration[J]. Management Science,1997,43(3):276-293.
[26]McCord K,Eppinger S.Managing the integration problem in concurrent engineering[M]. Massachusetts Institute of Technology,1993.
[27]Yassine A,Falkenburg D,Chelst K.Engineering design management:an information structure approach[J].International Journal of Production Research,1999,37(13):2957-2975.
[28]赵晋敏,刘继红,钟毅芳,等.并行设计中耦合任务集割裂规划的新方法[J].计算机集成制造系统,2001,7(4)：36-39,72.
[29]梅成刚,肖人彬.复杂设计过程的信息建模及重组[J].机械科学与技术,2004,(1)：105-109.
[30]肖人彬,费奇.改进的结构建模方法在煤矿综合管理中的应用[J].系统工程理论与实践,1997,(3)：57-62.
[31]陈柏鸿,肖人彬,刘继红.复杂产品协同优化设计中耦合因素的研究[J].机械工程学报,2001,37(1)：19-23.
[32]胡长建,郑力,李志忠,等.设计过程信息建模及重组集成框架研究[J].中国机械工程,2003,14(20)：1748-1752.
[33]刘天湖,陈新,陈新度,等.基于部件接口矩阵和设计结构矩阵的机电产品研发项目规划方法[J].中国机械工程,2006,17(11)：1142-1147.
[34]贡智兵,李东波,于敏健.基于设计结构矩阵变更的设计过程动态规划[J].计算机集成制造系统,2007,13(3)：437-441.
[35]曹宜英,秦现生,徐显龙.一种基于ProA递阶分解的产品开发进程规划方法[J].计算机集成制造系统,2008,14(8)：1489-1495.
[36]邓林义.资源受限的项目调度问题及其应用研究[D].大连：大连理工大学,2008.
[37]武照云.复杂产品开发过程规划理论与方法研究[D].合肥：合肥工业大学,2009.
[38]钱晓明.面向并行工程的产品开发过程关键技术研究[D].南京：南京航空航天大学,2004.
[39]马飞,同淑荣,李博,等.基于模糊设计结构矩阵的产品设计过程模块化分解[J].计算机集成制造系统,2010,16(3)：476-483.
[40]李潇波,赵亮,许正蓉.基于改进的DSM耦合任务规划方法的研究[J].中国机械工程,2010,21(2)：212-217.
[41]马肇兴,魏法杰.一种构造设计结构矩阵的简化方法[J].北京航空航天大学学报,2009,22(1)：24-28.
[42]施国强,李伯虎,柴旭东.基于设计结构矩阵的复杂产品开发项目规划模型[J].计算机集成制造系统,2007,13(11)：2105-2109,2210.
[43]Steward D.Systems Analysis and Management:structure,strategy,and design[M].Petrocelli books, 1981.
[44]Gebala D,Eppinger S.Methods for analyzing design procedures[A].[C].Atlanta,CA:ASME Press, 1991.
[45]McCulley C,Bloebaum C.A genetic tool for optimal design sequencing in complex engineering systems[J].Structural and Multidisciplinary Optimization,1996,12(2):186-201.
[46]Whitfield R I,Duffy A H B,Coates G,et al.Efficient process optimization[J].Concurrent Engineering,2003,11(2):83.
[47]陈冬宇,邱菀华,杨敏,等.基于设计结构矩阵理论的产品开发过程建模及仿真优化[J].计算机集成制造系统,2008,14(4)：661-666.
[48]姚咏,熊光楞,范文慧,等.基于PDM的产品开发过程智能化分析与改进[J].中国机械工程,2004,15(20)：1857-1860.
[49]Abdelsalam H M E,Bao H P.A simulation-based optimization framework for product development cycle time reduction[J].IEEE Transactions on Engineering Management,2006,53(1):69.
[50]陈冬宇,邱蔻华,杨青,等.基于DSM的复杂产品开发流程优化遗传算法[J].控制与决策,2008, 23(8)：910-914.
[51]钱晓明,王宁生,唐敦兵.基于DSM的产品开发过程资源优化算法[J].系统工程学报,2008,23(2)：238-242.
[52]武建伟, 郭峰, 藩双夏. 基于仿真评价的产品开发过程改进技术研究[J].计算机集成制造系统, 2007,13(12):2420-2426.
[53]Wang J. Constraint-based schedule repair for product development projects with time-limited constraints[J]. International Journal of Production Economics,2005,95(3):399-414.
[54]Luh P B, Liu F, Moser B. Scheduling of design projects with uncertain number of iterations[J]. European Journal of Operational Research,1999,113(3):575-592.
[55]Yan H S, Wang Z, Jiang M. A quantitative approach to the process modeling and planning in concurrent engineering[J]. Concurrent Engineering,2002,10(2):97.
[56]Lu C, Li X. Research on dynamic assignment of design tasks [A]. [C].2004.4201-4205
[57]Kavadias S, Loch C H. Optimal project sequencing with recourise at a scarce resource[J]. Production and Operations Management,2003,12(4):433-444.
[58]Chiang T A. The Minimum-cost PD Process Planning and Control Methodology with the Consideration of Resource/Time Constraints and Skill Levels[J]. Concurrent Engineering,2009, 17(4):257.
[59]Meier C, Yassine A A, Browning T R. Design process sequencing with competent genetic algorithms[J]. Journal of Mechanical Design,2007,129:566.
[60]. Todd D. Multiple criteria genetic algorithms in engineering design and operation[M]. Citeseer,1997.
[61]Scott J. A strategy for modelling the design-development phase of aproduct[J].1999.
[62]Guo Y W, Li W D, Mileham A R, et al. Applications of particle swarm optimisation in integrated process planning and scheduling[J]. Robotics and Computer-Integrated Manufacturing,2009, 25(2):280-288.
[63]杨波,黄可正,孙红卫.面向并行工程的任务分配与规划[J].计算机集成制造系统,2002,8(7)：542-545,560.
[64]李玉家,胡宗武,金烨.并行产品开发过程中的任务分配问题研究[J].中国机械工程,2002,13(7)：46-49.
[65]鲁建厦,陈呈频,兰秀菊,等.集成产品开发规划的任务调度[J].中国工程科学,2004,6(5)：56-60.
[66]赵传波,、赵伟伟.一种自主工作流任务分配策略[J].华中科技大学学报(自然科学版),2005,33(6)：20-22.
[67]宋李俊,杨育,杨洁,等.产品协同设计中的任务排序研究[J].中国机械工程,2008,19(7)：798-803.
[68]曹健,赵海燕,张友良,等.产品协同设计中的任务调度方法研究[J].中国机械工程,1999,10(5)：489-492.
[69]蒋增强,刘明周,赵韩,等.基于多目标优化的产品协同开发任务调度研究[J].农业机械学报,2,008,39(3)：154-158,162.
[70]Jirachai B. Multi-mode resource-constrained project scheduling problem with resource vacations and task splitting[D]. Oregon State University,2003.
[71]王永超.航空多型号项目计划与协调控制技术研究[D].西安：西北工业大学,2007.
[72]刘梅.基于资源约束的产品开发项目计划与控制研究[D].重庆：重庆大学,2008.
[73]黄卫东,谢强,丁秋林.基于动态调度和任务委派的多型号产品并行研发能力管理[J].武汉大学学报(工学版),2007,40(1)：120-125.
[74]张楠,闫雅馨,刘新华.基于工作流的多型号产品生产计划与调度系统[J].哈尔滨工业大学学报,2008,40(12)：2094-2098.
[75]Kraus S, Wilkenfeld J, Zlotkin G. Multiagent negotiation under time constraints* 1[J]. Artificial Intelligence,1995,75(2):297-345.
[76]Gao F, Yingwu C, Jiang g p. Model and Heuristic Algorithm of R&D Project Scheduling Problem with Stochastic Number of Activity Iterations [A]. Proceedings of the 2005 IEEE International Conference on Information Reuse and Integration[C]. Las Vegas, NV:IEEE Syst, Man & Cybernet Soc 2005.
[77]Chen Y, Gao F, Xin L. R&D project process model and AGA based scheduling algorithm[A]. [C].
[78]Wu B, Cheng T, Yang S, et al. Price-based negotiation for task assignment in a distributed network manufacturing mode environment[J]. The International Journal of Advanced Manufacturing Technology,2003,21(2):145-156.
[79]刘海龙,吴铁军.基于合同网的多agent任务分配分布式优化算法[J].浙江大学学报：工学版,2001,35(5)：550-554.
[80]张龙,刘民,刘涛,等.复杂产品开发项目调度问题的模糊优化算法[J].控制工程,2009,16(6)：731-734.
[81]罗荣桂,杨世宏,吴兵,等.柔性资源受限的复杂产品协同开发项目调度研究综述[J].武汉理工大学学报,2006,28(10)：77-79,86.
[82]罗荣桂,杨世宏,吴兵,等.面向复杂产品协同开发的柔性资源调度研究[J].武汉理工大学学报,2006,28(12)：97-100.
[83]Blazewicz J, Lenstra J K, Rinooy Kan A H G. Scheduling subject to resource constraints: Classification and complexity [J]. Discrete Applied Mathematics,1983,5:11-24.
[84]Brucker P, Drexl A, M hring R, et al. Resource-constrained project scheduling:Notation, classification, models, and methods[J]. European Journal of Operational Research,1999, 112(1):3-41.
[85]Hartmann S, Kolisch R. Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem[J]. European Journal of Operational Research, 2000,127(2):394-407.
[86]Kolisch R, Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling:An update[J]. European Journal of Operational Research,2006,174(1):23-37.
[87]Kolisch R, Padman R. An integrated survey of deterministic project scheduling[J]. Omega,2001, 29(3):249-272.
[88]Carruthers J, Battersby A. Advances in critical path methods[J]. OR,1966,17(4):359-380.
[89]Patterson J H, Huber W D. A Horizon-Varying, Zero-One Approach to Project Scheduling[J]. Management Science,1974,20(6):990-998.
[90]Patterson J H, Roth G W. Scheduling a project under multiple resource constraints:a zero-one programming approach[J]. IIE Transactions,1976,8(4):449-455.
[91]Mingozzi A, Maniezzo V, Ricciardelli S, et al. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation[J]. Management Science,1998, 44:714-729.
[92]Patterson J H, Slowinski R, Talbot F B, et al. An algorithm for a general class of precedence and resource constrained scheduling problems[J]. Advances in project scheduling,1989:3-28.
[93]Demeulemeester E L, Herroelen W. A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem[J]. Management Science,1992, 38(12):1803-1818.
[94]Simpson W P, Patterson J H. A multiple-tree search procedure for the resource-constrained project scheduling problem[J]. European Journal of Operational Research,1996,89(3):525-542
[95]Brucker P, Knust S, Schoo A, et al. A branch and bound algorithm for the resource-constrained project scheduling problem[J]. European Journal of Operational Research,1998,107(2):272-288.
[96]Sprecher A. Scheduling resource-constrained projects competitively at modest memory requirments[J]. Management Science,2000,46(5):710-723.
[97]Kim J L. A multiheuristic approach to resource constrained project scheduling:an adaptive hybrid genetic algorithm[D]. University of Florida Gainesville, FL, USA,2006.
[98]Christofides N, Alvarez-Valdes R, Tamarit J M. Project scheduling with resource constraints:A branch and bound approach[J]. European Journal of Operational Research,1987,29(3):262-273.
[99]Demeulemeester E L, Herroelen W. New benchmark results for the resource-constrained project scheduling problem[J]. Management Science,1997,43(11):1485-92.
[100]Klein R, Scholl A. Computing lower bounds by destructive improvement:An application to resource-constrained project scheduling[J]. European Journal of Operational Research,1999, 112(2):322-346.
[101]Brucker P, Knust S. A linear programming and constraint propagation-based lower bound for the RCPSP[J]. European Journal of Operational Research,2000,127(2):355-362.
[102]Holland J. Adaptation in natural and artificial systems[M]. MIT press Cambridge, MA,1992.
[103]Kolisch R, Sprecher A, Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems[J]. Management Science,1995,41:1693-1703.
[104]Valls V, Ballestin F, Quintanilla S. Justification and RCPSP:A technique that pays[J]. European Journal of Operational Research,2005,165(2):375-386.
[105]王为新. 航空产品项目资源优化方法研究[D]. 西安:西北工业大学,2006.
[106]Kolisch R. Serial and parallel resource-constrained project scheduling methods revisited:Theory and computation[J]. European Journal of Operational Research,1996,90(2):320-333.
[107]Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem[J]. Journal of Operations Management,1996,14(3):179-192.
[108]Ozdamar L, Ulusoy G. An iterative local constraints based analysis for solving the resource constrained project scheduling problem[J]. Journal of Operations Management,1996, 14(3):193-208.
[109]Thomas P R, Salhi S. An investigation into the relationship of heuristic performance with network-resource characteristics [J]. Journal of the Operational Research Society,1997,48(1):34-43.
[110]Ozdamar L, Ulusoy G. A-note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis[J]. European Journal of Operational Research,1996,89(2):400-407.
[111]Kolisch R, Drexl A. Adaptive search for solving hard project scheduling problems[J]. Naval Research Logistics,1996,43(1):23-40.
[112]Kolisch R. Project scheduling under resource constraints:efficient heuristics for several problem classes [M]. Springer Verlag,1995.
[113]Alvarez-Valdes R, Tamarit J M. Heuristic algorithms for resource-constrained project scheduling:A review and an empirical analysis[J]. Advances in project scheduling,1989,134:113-134.
[114]Hegazy T. Optimization of Resource Allocation and Leveling Using Genetic Algorithms [J]. Journal of Construction Engineering and Management,1999,125(3):167-175.
[115]Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling[J]. Naval Research Logistics,1998,45(7):733-750.
[116]Hartmann S. A self-adapting genetic algorithm for project scheduling under resource constraints[J]. Naval Research Logistics,2002,49(5):433-448.
[117]Alcaraz J, Maroto C. A Robust Genetic Algorithm for Resource Allocation in Project Scheduling[J]. Annals of Operations Research,2001,102(1):83-109.
[118]Alcaraz J, Maroto C, Ruiz R. Improving the performance of genetic algorithms for the RCPS problem[A]. [C].2004:40-43
[119]Hindi K S, Hongbo Y, Fleszar K. An evolutionary algorithm for resource-constrained project scheduling[J]. Evolutionary Computation, IEEE Transactions on,2002,6(5):512-518.
[120]刘士新,王梦光,唐加福.一种求解资源受限工程调度问题的遗传算法[J].系统工程学报,2002,17(01)：1-7.
[121]Coelho J S, Tavares L V. Comparative analysis of meta-heuristics for the resource constrained project scheduling problem[R].2003. Portugal
[122]Mendes J J M, Goncalves J F, Resende M G C. A random key based genetic algorithm for the resource constrained project scheduling problem[J]. Computers & Operations Research, 2009, 36(1):92-109.
[123]Valls V, Ballestin F, Quintanilla S. A hybrid genetic algorithm for the resource-constrained project scheduling problem[J]. European Journal of Operational Research,2008,185(2):495-508.
[124]Debels D, Vanhoucke M. A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem[J]. Operations Research,2007,55(3):457-469.
[125]Kim K W, Gen M, Yamazaki G. Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling[J]. Applied Soft Computing,2003,2(3):174-188.
[126]Boctor F F. Resource-constrained project scheduling by simulated annealing[J]. International Journal of Production Research,1996,34(8):2335-2351.
[127]Bouleimen K, Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version[J]. European Journal of Operational Research,2003,149(2):268-281.
[128]Nonobe K, Ibaraki T. Formulation and tabu search algorithm for the resource constrained project scheduling problem[M]. Kluwer Academic Publishers,2001.
[129]Kochetov Y, Stolyar A. Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem[A]. Proceedings of the 3rd international workshop of computer science and information technologies[C]. Russia2003.
[130]Tseng L Y, Chen S C. A hybrid metaheuristic for the resource-constrained project scheduling problem[J]. European Journal of Operational Research,2006,175(2):707-721.
[131]Merkle D, Middendorf M, Schmeck H. Ant colony optimization for resource-constrained project scheduling[J]. IEEE Transactions on Evolutionary Computation,2002,6(4):333-346.
[132]Luo S, Wang C, Wang J. Ant colony optimization for resource-constrained project scheduling with generalized precedence relations[A]. Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence table of contents[C].2003.
[133]Debels D, De Reyck B, Leus R, et al. A hybrid scatter search/electromagnetism meta-heuristic for project scheduling[J]. European Journal of Operational Research,2006,169(2):638-653.
[134]Yamashita D S, Armentano V A, Laguna M. Scatter search for project scheduling with resource availability cost[J]. European Journal of Operational Research,2006,169(2):623-637.
[135]Mobini M D M, Rabbani M, Amalnik M S, et al. Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem[J]. Soft Computing,2009,13(6):597-610.
[136]Valls V, Quintanilla S, Ballestin F. Resource-constrained project scheduling:A critical activity reordering heuristic[J]. European Journal of Operational Research,2003,149(2):282-301.
[137]Zamani R, Shue L. Solving project scheduling problems with a heuristic learning algorithm[J]. Journal of the Operational Research Society,1998:709-716.
[138]Schirmer A. Case-based reasoning and improved adaptive search for project scheduling[J]. Naval Research Logistics,2000,47(3):201-222.
[139]Colak S, Agarwal A, Erenguc S S. Resource constrained project scheduling:a hybrid neural approach[J]. International Series In Operations Research And Management Science,2006, 92:297-297.
[140]Valls V, Ballestin F, Quintanilla S. A Population-Based Approach to the Resource-Constrained Project Scheduling Problem[J]. Annals of Operations Research,2004,131(1):305-324.
[141]Elmaghraby S E. Activity networks:Project planning and control by network models[M]. John Wiley & Sons,1977.
[142]Talbot F B. Resource-constrained project scheduling with time-resource tradeoffs:The nonpreemptive case[J]. Management Science,1982:1197-1210.
[143]Patterson J H, Slowinski R, Weglarz J. Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems[J].1990.
[144]Talbot F B, Patterson J H. An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems[J]. Management Science,1978,24(11):1163-1174.
[145]Sprecher A, Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm[J]. European Journal of Operational Research,1998, 107(2):431-450.
[146]Speranza M G, Vercellis C. Hierarchical models for multi-project planning and scheduling[J]. European Journal of Operational Research,1993,64(2):312-325.
[147]Hartmann S, Sprecher A. A note on "Hierarchical models for multi-project planning and scheduling"[J]. European Journal of Operational Research,1996,94(2):377-383.
[148]Sprecher A, Hartmann S, Drexl A. An exact algorithm for project scheduling with multiple modes[J]. OR Spectrum,1997,19(3):195-203.
[149]Demeulemeester E L, Herroelen W S. A Branch-And-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem[J]. Operations Research,1997,45(2):201-212.
[150]Hartmann S, Drexl A. Project scheduling with multiple modes:A comparison of exact algorithms[J]. Networks,1998,32(4):283-297.
[151]Sprecher A, Hwang C. Resource-constrained project scheduling(exact methods for the multi-mode case)[A]. Lecture notes in economics and mathematical systems[C]. Berlin, Germany:Springer-Verlag,1994.
[152]刘士新.项目优化调度理论与方法[M].北京：机械工业出版社,2006.
[153]Drexl A, Gruenewald J. nonpreemptive multi-mode resource-constrained project scheduling[J]. IIE-Transactions,1993,25(5):74-81.
[154]Slowinski R, Soniewicki B, Weglarz J. DSS for multiobjective project scheduling[J]. European Journal of Operational Research,1994,79(2):220-229.
[155]Boctor F F. Heuristics for scheduling projects with resource restrictions and several resource-duration modes[J]. International Journal of Production Research,1993,31(11):2547-2558.
[156]Boctor F F. A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes[J]. European Journal of Operational Research,1996,90(2):349-361.
[157]?zdamar L, Ulusoy G. A local constraint based analysis approach to project scheduling under general resource constraints[J]. European Journal of Operational Research,1994,79(2):287-298.
[158]Ulusoy G, zdamar L. A framework for an interactive project scheduling system under limited resources[J]. European Journal of Operational Research,1996,90(2):362-375.
[159]Kolisch R, Drexl A. Local search for nonpreemptive multi-mode resource-constrained project scheduling[J]. IIE-Transactions,1997,29(11):987-999.
[160]Ozdamar L. A genetic algorithm approach to a general category project scheduling problem[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part C:Applications and Reviews,1999, 29(1):44-59.
[161]Hartmann S. Project scheduling with multiple modes:A genetic algorithm[J]. Annals of Operations Research,2001,102(1):111-135.
[162]Kim K W, Gen M, Kim M H. Adaptive genetic algorithms for multi-resource constrained project scheduling problem with multiple modes[J]. International Journal of Innovative Computing, Information & Control,2006,2(1):41-49.
[163]刘士新,王梦光,聂义勇.多执行模式资源受限工程调度问题的优化算法[J].系统工程学报, 2001,16(1):55-60.
[164]Jozefowska J, Mika M, R6 ycki R, et al. Simulated annealing for multi-mode resource-constrained project scheduling[J]. Annals of Operations Research,2001,102(1):137-155.
[165]Zhang H, Tam C M, Li H. Multimode project scheduling based on particle swarm optimization[J]. Computer Aided Civil and Infrastructure Engineering,2006,21(2):93-103.
[166]Jarboui B, Damak N, Siarry P, et al. A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems[J]. Applied Mathematics and Computation,2008,195(1):299-308.
[167]程晓梅.基于微粒群算法的多模式资源受限项目调度优化问题研究[D].合肥:合肥工业大学, 2007.
[168]Mori M, Tseng C C.A genetic algorithm for multi-mode resource constrained project scheduling problem[J]. European Journal of Operational Research,1997,100(1):134-141.
[169]Damak N, Jarboui B, Siarry P, et al. Differential evolution for solving multi-mode resource-constrained project scheduling problems[J]. Computers & Operations Research,2009, 36(9):2653-2659.
[170]Storn R, Price K. Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces[J]. Journal of Global Optimization,1997,11(4):341-359.
[171]Slowinski R. Multiobjective project scheduling under multiple-category resource constraints[A]. Advances in project scheduling[C]. amsterdam:Elsevier Science Ltd,1989.151-167
[172]Abbasi B, Shadrokh S, Arkat J. Bi-objective resource-constrained project scheduling with robustness and makespan criteria[J]. Applied Mathematics and Computation,2006,180(1):146-152.
[173]Hapke M, Jaszkiewicz A, Slowinski R. Interactive analysis of multiple-criteria project scheduling problems[J]. European Journal of Operational Research,1998,107(2):315-324.
[174]Viana A, Pinho de Sousa J. Using metaheuristics in multiobjective resource constrained project scheduling[J]. European Journal of Operational Research,2000,120(2):359-374.
[175]Al-Fawzan M A, Haouari M. A bi-objective model for robust resource-constrained project scheduling[J]. International Journal of Production Economics,2005,96(2):175-187.
[176]傅奥.多目标资源受限项目调度问题蚁群算法研究[D].杭州：浙江大学,2008.
[177]周树发,刘莉.工程网络计划中的多目标优化问题[J].华东交通大学学报,2004,21(2)：10-13.
[178]王宏.求解资源受限项目调度问题算法的研究[D].天津：天津大学,2005.
[179]Glover F. heuristics for integer programming using surrogate constraints [J]. Decision Sciences,1977, 8(1):156-166.
[180]Glover F. A template for scatter search and path relinking[J]. Lecture Notes in Computer Science, 1998,1363:13-54.
[181]Marti R. Scatter search-wellsprings and challenges[J]. European Journal of Operational Research, 2006,169(2):351-358.
[182]Valls V, Laguna M, Lino P, et al. Project scheduling with stochastic activity interruptions[J]. International Series In Operations Research And Management Science,1999:333-354.
[183]Laguna M, Marti R, Mart" a R. Scatter search:methodology and implementations in C[M]. Springer Netherlands,2003.
[184]Chu F, Labadi N, Prins C. A scatter search for the periodic capacitated arc routing problem[J]. European Journal of Operational Research,2006,169(2):586-605.
[185]Cordon O, Damas S, Santamar'aa J, et al.3D inter-subject medical image registration by scatter search[J]. Hybrid Metaheuristics:90-103.
[186]Cotta C. Scatter search with path relinking for phylogenetic inference[J]. European Journal of Operational Research,2006,169(2):520-532.
[187]Pi ana E, Plana I, Campos V, et al. GRASP and path relinking for the matrix bandwidth minimization* 1[J]. European Journal of Operational Research,2004,153(1):200-210.
[188]Wang Y S, Teng H F, Shi Y J. Cooperative co-evolutionary scatter search for satellite module layout design[J]. Engineering Computations:Int J for Computer-Aided Engineering,2009,26(7):761-785.
[189]Yamashita D S, Armentano V A, Laguna M. Robust optimization models for project scheduling with resource availability cost[J]. Journal Of Scheduling,2007,10(1):67-76.
[190]Ranjbar M, De Reyck B, Kianfar F. A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling[J]. European Journal of Operational Research,2009,193(1):35-48.
[191]李中凯,谭建荣,冯毅雄,等.基于拥挤距离排序的多目标粒子群优化算法及其应用[J].计算机集成制造系统,2008,14(7)：1329-1336.
[192]魏巍,谭建荣,冯毅雄,等.柔性工作车间调度问题的多目标优化方法研究[J].计算机集成制造系统,2009,15(8)：1592-1598.
[193]肖人彬,邹洪富,陶振武.公差设计多目标模型及其粒子群优化算法研究[J].计算机集成制造系统,2006,12(7):976-980,989.
[194]Schaffer J. Multiple objective optimization with vector evaluated genetic algorithms[A]. [C].L. Erlbaum Associates Inc. Hillsdale, NJ, USA,1985.93-100
[195]Hajela P, Lin C. Genetic search strategies in multicriterion optimal design[J]. Structural and Multidisciplinary Optimization,1992,4(2):99-107.
[196]Fonseca C M, Fleming P J. Genetic algorithms for multiobjective optimization:Formulation, discussion and generalization[A]. Proceedings of 5th International Congress on Genetic Algorithms[C]. California1993.416-423
[197]Srinivas N, Deb K. Muiltiobjective optimization using nondominated sorting in genetic algorithms[J]. Evolutionary Computation,1994,2(3):221-248.
[198]Deb K, Pratap A, Agarwal S, et al. A fast and elitist multiobjective genetic algorithm:NSGA-II[J]. IEEE Transactions on Evolutionary Computation,2002,6(2):182-197.
[199]Horn J, Nafpliotis N, Goldberg D E. A niched Pareto genetic algorithm for multiobjective optimization[A]. Proceedings of the First IEEE Conference on Evolutionary Computation,IEEE World Congress on Computational Intelligence[C].Citeseer,1994.82-87
[200]Zitzler E, Thiele L. Multiobjective evolutionary algorithms:A comparative case study and the strength pareto approach[J]. IEEE Transactions on Evolutionary Computation,1999,3(4):257-271.
[201]Zitzler E, Laumanns M, Thiele L. SPEA2:Improving the strength Pareto evolutionary algorithm[A]. Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems[C].Citeseer,2001.95-100
[202]Bergey P K. An agent enhanced intelligent spreadsheet solver for multi-criteria decision making[A]. In:Proceddings of the Fifth Americas Conference on Information Systems (AMCIS 1999), [C]. Milwaukee, Wisconsin, USA1999.966-968
[203]Abbass H A. The self-adaptive pareto differential evolution algorithm[A]. In:Evolutionary Computation,2002. CEC'02. Proceedings of the 2002 Congress on[C].2002.831-836
[204]CINVESTAV-IPN M. Evolutionary multi-objective optimization:a historical view of the field[J]. IEEE Computational Intelligence Magazine,2006, 1(1):28-36.
[205]Chang C S, Xu D Y, Quek H B. Pareto-optimal set based multiobjective tuning of fuzzy automatic train operation for mass transit system[J]. IEE Proceedings-Electric Power Applications,1999, 146(5):577-577.
[206]Xue F. Multi-objective differential evolution:Theory and applications[D]. Rensselaer Polytechnic Institute,2004.
[207]Babu B V, Jehan M M L. Differential evolution for multi-objective optimization[J]. Evolutionary Computation,2003,4:8-12.
[208]Iorio A, Li X. Solving rotated multi-objective optimization problems using differential evolution[A]. In AI 2004:Advances in Artificial Intelligence, Springer-Verlag, Lecture Notes in Artificial Intelligence[C].2005.861-872
[209]Iorio A W, Li X. Incorporating directional information within a differential evolution algorithm for multi-objective optimization[A]. [C].ACM,2006.691-698
[210]Santana-Quintero L V, Coello C A C. An algorithm based on differential evolution for multi-objective problems[J]. International Journal of Computational Intelligence Research,2005, 1(1-2):151-169.
[211]Kukkonen S, Lampinen J. GDE3:the third evolution step of generalized differential evolution[A]. Evolutionary Computation,2005. The 2005 IEEE Congress on[C].2005.443-450 Vol.1
[212]Muhlenbein H, Paass G. From recombination of genes to the estimation of distributions:I. binary parameters [J]. Lecture Notes in Computer Science,1996,1141:178-187.
[213]Bosman P A N, Thierens D. Advancing continuous IDEAs with mixture distributions and factorization selection metrics[A]. Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at GECCO-2001[C]. San Francisco, California2001. 208-212
[214]Grahl J, Minner S, Rothlauf F. Behaviour of UMDAc with truncation selection on monotone functions[A]. Proceedings of IEEE Confgress on Evolutionary Computation, Piscataway[C]. New Jersey2005.2553-2559
[215]Bosman P A N, Thierens D. Continuous iterated density estimation evolutionary algorithms within the IDEA framework[A]. Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at GECCO-2000[C].2000.197-200
[216]Grahl J, Bosman P A N, Rothlauf F. The correlation-triggered adaptive variance scaling IDEA[A]. [C].ACM,2006.404-404
[217]Bosman P A N. Design and application of iterated density-estimation evolutionary algorithms[J]. Utrecht, Institute of Information and Computing Sciences. Phd. Thesis,2003.
[218]Larranaga P. A review on estimation of distribution algorithms, chapter 3[M]. Kluwer Academic Publishers,2002.
[219]Pelikan M, Goldberg D E, Lobo F G. A survey of optimization by building and using probabilistic models[J]. Computational optimization and applications,2002,21(1):5-20.
[220]周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2)：113-124.
[221]Dong W, Yao X. Covariance matrix repairing in Gaussian based EDAs[A]. [C].Citeseer,2007. 415-422-415-422
[222]Rudlof S, Koppen M. Stochastic hill climbing with learning by vectors of normal distributions[J]. Nagoya, Japan,1996.
[223]Servet I, Trave-Massuyes L, Stern D. Evolutionary computation techniques for traffic supervision based on a model of telephone networks built from qualitative knowledge[J]. Stud. Inf. Control (Romania),1997,6(1):65-74.
[224]Gallagher M, Frean M, Downs T. Real-valued evolutionary optimization using a flexible probability density estimator[A]. [C].Citeseer,1999.840-846-840-846
[225]Larranaga P, Etxeberria R, Lozano J A, et al. Optimization by learning and simulation of Bayesian and Gaussian networks[J]. University of the Basque Country Technical Report EHU-KZAAIK-4, 1999,99.
[226]Liu J, Teng H. Model learning and variance control in continuous edas using pca[A]. [C].2008. 555-555
[227]Shi Y, Teng H, Li Z. Cooperative co-evolutionary differential evolution for function optimization[J]. Advances in Natural Computation,2005:1080-1088.
[228]Teng H F, Chen Y, Zeng W, et al. A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm:Satellite-Module Layout Design[J]. IEEE Transactions on Evolutionary Computation, 2010,14(3):438-455.
[229]王奕首,滕弘飞,金博,等.实现中小企业产品设计重用的若干途径[J].计算机工程与应用,2007,43(9)：88-91,135.
[230]金博.面向专利和零部件的设计知识检索方法[D].大连：大连理工大学,2009.
[231]金博,史彦军,滕弘飞.基于语义理解的文本相似度算法[J].大连理工大学学报,2005,45(2)：291-297.
[232]彭毅,吴祚宝,张珂殊,等.并行工程产品开发过程的建模方法学[J].系统仿真学报,1996,8(3)：14-18.
[233]Smith R P. The historical roots of concurrent engineering fundamentals[J]. IEEE Transactions on Engineering Management,1997,44(1):67-78.
[234]祖旭.基于Petri网理论的产品开发过程建模方法研究[D].大连：大连理工大学,2005.
[235]施国强,李伯虎,柴旭东.基于着色Petri网的复杂产品开发多项目调度建模研究[J].系统仿真学报,2007,19(17)：3869-3972,3948.
[236]张维明.语义信息模型及应用[M].北京：电子工业出版社,2002.
[237]Bidarra R, Bronsvoort W F. Semantic feature modelling[J]. Computer Aided Design,2000,32(3)：201-25.
[238]Lee K Y, Lee W J, Roh M I. Development of a semantic product modeling system for initial hull structure in shipbuilding[J]. Robotics and Computer-Integrated Manufacturing,2004,20(3):211-223.
[239]岳小莉,陆国栋,叶金荣,等.面向图样理解的工程语义获取技术研究[J].中国图像图形学报,2002,7(7)：672-678.
[240]刘振宇,谭建荣,张树有.基于语义识别的虚拟装配运动引导研究[J].软件学报,2002,13(3)：382-389.
[241]冯毅雄,谭建荣,张树有,等.一种基于符号的产品设计单元重用技术[J].中国机械工程,2003,14(15)：1309-1314.
[242]Berners-Lee T. Semantic web road map[J]. IW3C Design Issues, Cambridge,1998.
[243]许方芳,郑诚,戈明东.语义网中的本体映射研究[J].计算机与现代化,2008,24(2)：36-39.
[244]冯绍军,陈禹六.系统集成的约束机理研究[J].系统工程理论与实践,2002,(5)：26-30.
[245]刘建刚.并行工程中产品结构和开发过程集成管理关键技术研究[D].南京：南京航空航天大 学,2006.
[246]Eppinger S D, Whitney D E, Smith R P, et al. A model-based method for organizing tasks in product development[J]. Research in Engineering Design,1994,6(1):1-13.
[247]郭峰. 机械产品设计过程的建模、评价与优化方法研究[D]. 杭州: 浙江大学,2007.
[248]柳玲,李百战,杨明宇.建筑协同设计中冲突模型的研究[J].工程图学学报,2006,(1)：55-60.
[249]Warfield J N. Binary matrices in system modeling[J]. IEEE Transactions on Systems, Man, and Cybernetics,1973,3(5).
[250]陆元鸿.数理统计方法[M].华东理工大学出版社,2005.
[251]M113A2 Armored Personnel Carrier Desert Version. http://www.lsmodel.com/static/model kinds/military/tamiya tank/35265.htm
[252]M113A2三向试图.http://www.inetres.com/gp/military/cv/inf/M113/M113A2_camo2.gif
[253]TX200传动装置.http://www.defenseonline.com.cn/weapon/tank/cdzz/cdzz607.htnn
[254]Kolisch R, Hartmann S. Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem:Classification and Computational Analysis, in J. Weglarz, ed., Project Scheduling:Recent Models, algorithms and Applications, Kluwer Academic Publishers, Berlin, 1999, pp.147-178.[M].1999.
[255]Glover F. A template for scatter search and path relinking[J]. Artificial Evolution,1998,1363:13-54.
[256]Glover F, Laguna M, Marti R. Scatter search[M]. Springer-Verlag New York, Inc.,2003.
[257]Marti R, Laguna M, Glover F. Principles of scatter search[J]. European Journal of Operational Research,2006,169(2):359-372.
[258]Dorigo M, Caro G D. The ant colony optimization meta-heuristic, in:D. Corne, M. Dorigo, F. Glover(Eds.), New Ideas in Optimization, McGraw-Hill, London,1999, pp.11-32[J].
[259]Dorigo M, Maniezzo V, Colorni A. The ant system:optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems, Man and Cybernetics,1996,26(1):29-41.
[260]Dorigo M, Stutzle T. Ant Colony Optimization[M]. MIT Press,2004.
[261]Dorigo M, Gambardella L M. Ant colony system:A cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation,1997, 1(1):53-66.
[262]Tsai C F, Tsai C W, Tseng C C. A new hybrid heuristic approach for solving large traveling salesman problem[J]. Information Sciences,2003,166(1-4):67-81.
[263]Kolisch R, Hartmann S. heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis[J]. Project scheduling:Recent models, algorithms, and applications,1999:147-147.
[264]Stutzle T, Hoos H H. Max-min ant system[J]. Future Generation Computer Systems,2000, 16(8):889-914.
[265]Drexl A. Scheduling of Project Networks by Job Assignment[J]. Management Science,1991, 37(12):1590-1602.
[266]Shaffer L R, Ritter J B, Meyer W L. The critical-path method[M]. McGraw-Hill Inc., US,1965.
[267]Davis E W, Patterson J H. A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling[J]. Management Science,1975,21(8):944-955.
[268]Thesen A. Heuristic Scheduling of Activities under Resource and Precedence Restrictions[J]. Management Science,1976,23(4):412-422.
[269]Cooper D F. Heuristics for Scheduling Resource-Constrained Projects:An Experimental Investigation[J]. Management Science,1976,22(11):1186-1194.
[270]Whitehouse G E, Brown J R. GENRES:An extension of Brooks algorithm for project scheduling with resource constraints [J]. Computers and Industrial Engineering,1979,3(4):261-268.
[271]Elsayed E A. Algorithms for project scheduling with resource constraints-International Journal of Production Research[J]. International Journal of Production Research,1982,20(1):95-103.
[272]Fleszar K, Hindi K S. Solving the resource-constrained project scheduling problem by a variable neighbourhood search[J]. European Journal of Operational Research,2004,155(2):402-413.
[273]Klein R. Bidirectional planning:improving priority rule-based heuristics for scheduling resource-constrained projects[J]. European Journal of Operational Research,2000,127(3):619-638.
[274]Ying K C, Lin S W, Lee Z J. Hybrid-directional planning:improving improvement heuristics for scheduling resource-constrained projects[J]. The International Journal of Advanced Manufacturing Technology,2009,41(3):358-366.
[275]Nebro A J, Luna F, Alba E, et al. AbYSS:Adapting scatter search to multiobjective optimization[J]. IEEE Transactions on Evolutionary Computation,2008,12(4):439-457.
[276]Patterson J H. A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem[J]. Management Science,1984,30(7):854-867.
[277]Demeulemeester E L, Vanhoucke M, Herroelen W. RanGen:A random network generator for activity-on-the-node networks[J]. Journal Of Scheduling,2003,6(1):17-38.
[278]刘士新,王梦光.多资源受限工程网络的随机生成器[J].东北大学学报,1997,18(5)：494-497.
[279]Qian B, Wang L, Huang D, et al. An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers[J]. Computers and Operations Research,2009,36(1):209-233.
[280]Pan N H, Hsaio P W, Chen K Y. A study of project scheduling optimization using Tabu Search algorithm[J]. Engineering Applications of Artificial Intelligence,2008,21(7):1101-1112.
[281]Tormos P, Lova A. Integrating heuristics for resource constrained project scheduling:One step forward[J]. Technicalreport, Department of Statistics and Operations Research, Universidad Politecnica de Valencia,2003.
[282]Valls V, Ballestin F, Quintanilla M S. A hybrid genetic algorithm for the RCPSP[R].2003.
[283]Palpant M, Artigues C, Michelon P. LSSPER:Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search[J]. Annals of Operations Research,2004, 131(1):237-257.
[284]Artigues C, Michelon P, Reusser S. Insertion techniques for static and dynamic resource-constrained project scheduling[J]. European Journal of Operational Research,2003,149(2):249-267.
[285]唐焕文,秦学志.实用最优化方法[M].大连：大连理工大学出版社,2000.
[286]Lampinen J. DE's selection rule for multiobjective optimization[J]. Lappeenranta University of Technology, Department of Information Technology," Technical Report,2001:03-04.
[287]Chen Y, Zhang Y, Abraham A. Estimation of distribution algorithm for optimization of neural networks for intrusion detection system[J]. Lecture Notes in Computer Science,2006,4029:9-18.
[288]Abbass H A, Sarker R, Newton C. PDE:A pareto-frontier differential evolution approach for multi-objective optimization problems[A]. [C].Citeseer,2001.971-978-971-978
[289]王小平,曹立明.遗传算法——理论、应用与软件实现[M].西安：西安交通大学出版社,2002.
[290]阎平凡,张长水.人工神经网络与模拟进化计算[M].北京：清华大学出版社,2005.
[291]Larranaga P, Lozano J A, Bengoetxea E. Estimation of distribution algorithms based on multivariate normal and Gaussian networks[J]. University of the Basque Country, Technical Report: KZZA-IK-1-01,2001.
[292]Larranaga P, Lozano J. Estimation of distribution algorithms:A new tool for evolutionary computation[M]. Kluwer Academic Pub,2002.
[293]Price, K., Storn R. Web site of Price and Storn as on July,2000. http://www.icsi.berkeley.edu/-storn/code.html
[294]Gamperle R, Muller S, Koumoutsakos P. A parameter study for differential evolution[J]. Advances in Intelligent systems, Fuzzy systems, Evolutionary computation,2002:293-298.
[295]Coello C, Lamont G, Van Veldhuizen D. Evolutionary algorithms for solving multi-objective problems[M]. Springer-Verlag New York Inc,2007.
[296]袁俊刚,孙治国,曲广吉.差异演化算法应用问题研究[J].计算机工程与应用,2007,43(7)：75-77.
[297]Deb K, Thiele L, Laumanns M, et al. Scalable test problems for evolutionary multi-objective optimization[J]. Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, 2005:105-145.
[298]Hollingsworth D. The workflow reference model[M]. Workflow Management Coalition,1995.
[299]Aalst W v d, Hee K v. WorkFlow Management:Models, Methods, and Systems[M]. London:The MIT Press,2002.