资源受限的项目调度问题及其应用研究
|
摘要
资源受限的项目调度问题(Resource-Constrained Project Scheduling Problem,RCPSP)是运筹学领域的一个重要分支,它要求在满足项目时序约束和资源约束的条件下,安排所有任务的开始时间和结束时间,以达到工期最短、资源均衡、代价最小等目标。本文针对RCPSP的三个分支(经典的项目调度问题、任务可拆分项目调度问题以及多项目调度问题)进行了研究,取得了较好的结果。
针对经典的资源受限的项目调度问题,本文提出了一种根据粒子适应值的变化动态调整惯性权重的粒子群算法,对标准粒子群算法(Particle Swarm Optimization,PSO)的惯性权重的调整策略进行改进。在此基础上给出了基于优先数编码的粒子群算法(PrirorityValue Based Particle Swarm Optimization,PVPSO)与基于优先规则编码的粒子群算法(Prirority Rule Based Particle Swarm Optimization,PRPSO)。其中PVPSO算法采用了一种启发式信息与随机信息相结合的初始化方法,比全部采用随机信息的初始化方法所选取的初始种群效果更好。PRPSO以粒子群算法为基础,搜索求解RCPSP问题最优优先规则组合。本文还提出了一种基于任务列表的混合粒子群算法(Permuation Based ParticleSwarm Optimization,PEPSO),该算法将遗传算法中的单点交叉引入到粒子的更新过程中,通过增加粒子的局部搜索技术帮助粒子跳出局部最优解。在PSPLIB测试集上的实验表明,与其他启发式算法相比,本文给出的算法PVPSO、PRPSO与PEPSO与本问题国内外其它同类算法相比,最短工期的平均偏差率均较低。
针对允许通过任务拆分以缩短工期的资源受限的项目调度问题,本文采用PEPSO算法对Patterson问题集进行了测试,结果表明PEPSO算法能有效地缩短项目的偏差率。
为进一步解决经典的任务不可拆分的项目调度问题,本文提出了一种基于虚拟任务拆分预测的PWiest方法,与优先规则、粒子群算法和蚁群算法等智能优化方法相结合,有效改进了算法的性能,PSPLIB集上的测试结果表明新算法能够进一步降低算法的偏差率。
针对无耦合任务的多项目调度问题,本文提出了基于迭代的拓扑优化方法,根据项目网络结构的特点进行任务调度,在任务的调度过程中综合考虑任务的各种信息,如项目资源的影响,后续任务影响、关键路径任务优先以及最小空闲时间等优先规则。通过实例测试结果表明,该方法与其它启发式方法相比能得到更短的工期。对含有耦合任务的多项目调度问题,本文采用设计结构矩阵(Design Structure Matrix,DSM)表示含有耦合信息的任务之间的关系,给出了基于信息量对DSM中的耦合集进行解耦的方法。针对实际设计任务调度的特点,结合耦合信息的割裂方法和迭代拓扑优化方法,提出了求解含有耦合关系的多项目调度问题的拓扑优化方法。并将该方法应用到船舶设计任务调度系统中。
Within the classical resource-constrained project scheduling problem(RCPSP),the activities of a project have to be scheduled such that the makespan(cost,etc.) of the project is minimized.RCPSP continues to be an active area of research attracting in recent years increasing interest from researchers and practitioners in the search for better solution procedures.The purpose of this paper is to introduce some new optimization algorithms to solve three kinds of RCPSP:classical RCPSP,preemptive RCPSP and resource-constrained multi-project scheduling problem(RCMPSP).
To solve the classical RCPSP,we introduce a particle swarm optimization(PSO) with dynamic inertia weight to adjust the inertia weight with the fitness of particles.Three PSO procedures based on different solution representations are propsed—Priority Value Based Particle Swarm Optimization(PVPSO),Priority Rule Based Particle Swarm Optimization (PRPSO),and Permutation Based Particle Swarm Optimization(PEPSO).PVPSO employs a new initialization method in which the heuristic information is added to the classical randomized method to improve the performance of the algorithm.PRPSO searches the optimal combination of priority rules based on PSO.PEPSO adopts the one-point crossover technique into the updating of particles,and makes use of a local search to help the particle escape the local optimum.Numerical results obtained from the PSPLIB show that these PSOs yields better results than several heuristic procedures presented in the literature
This paper provides the PSOs for the preemptive RCPSP.The experiments on Patterson show that the acitivity splitting can short the makespan of project.This paper develops a new wiest's justification in which the activity splitting is applied to predict whether the schedule could be improved.The new Wiest's justification with prediction(PWiest) was applied to improve the performance of algorithms,such as priority-rule heuristic method,particle swarm optimization and ant colony system and so on,for classic RCPSP,and the algorithms are approved with these experiments on PSPLIB.
Finally,the paper studies resource-constrained multi-project scheduling problem (RCMPSP) in which each project has a priority.For RCMPSP without coupling sets,we propose a topological travel optimization algorithm in which various influence factors are considered(such as resources constraints,successors,critical-path-activity-first,etc.).For RCMPSP with coupling sets,we present an uncouple method to deal with the coupling sets in DSM,which is used to represent the coupling relations between activities.The algorithms have been applied to the development of the Ship Design Plan Management System of Dalian Heavy Industry Ship Yard.
针对经典的资源受限的项目调度问题,本文提出了一种根据粒子适应值的变化动态调整惯性权重的粒子群算法,对标准粒子群算法(Particle Swarm Optimization,PSO)的惯性权重的调整策略进行改进。在此基础上给出了基于优先数编码的粒子群算法(PrirorityValue Based Particle Swarm Optimization,PVPSO)与基于优先规则编码的粒子群算法(Prirority Rule Based Particle Swarm Optimization,PRPSO)。其中PVPSO算法采用了一种启发式信息与随机信息相结合的初始化方法,比全部采用随机信息的初始化方法所选取的初始种群效果更好。PRPSO以粒子群算法为基础,搜索求解RCPSP问题最优优先规则组合。本文还提出了一种基于任务列表的混合粒子群算法(Permuation Based ParticleSwarm Optimization,PEPSO),该算法将遗传算法中的单点交叉引入到粒子的更新过程中,通过增加粒子的局部搜索技术帮助粒子跳出局部最优解。在PSPLIB测试集上的实验表明,与其他启发式算法相比,本文给出的算法PVPSO、PRPSO与PEPSO与本问题国内外其它同类算法相比,最短工期的平均偏差率均较低。
针对允许通过任务拆分以缩短工期的资源受限的项目调度问题,本文采用PEPSO算法对Patterson问题集进行了测试,结果表明PEPSO算法能有效地缩短项目的偏差率。
为进一步解决经典的任务不可拆分的项目调度问题,本文提出了一种基于虚拟任务拆分预测的PWiest方法,与优先规则、粒子群算法和蚁群算法等智能优化方法相结合,有效改进了算法的性能,PSPLIB集上的测试结果表明新算法能够进一步降低算法的偏差率。
针对无耦合任务的多项目调度问题,本文提出了基于迭代的拓扑优化方法,根据项目网络结构的特点进行任务调度,在任务的调度过程中综合考虑任务的各种信息,如项目资源的影响,后续任务影响、关键路径任务优先以及最小空闲时间等优先规则。通过实例测试结果表明,该方法与其它启发式方法相比能得到更短的工期。对含有耦合任务的多项目调度问题,本文采用设计结构矩阵(Design Structure Matrix,DSM)表示含有耦合信息的任务之间的关系,给出了基于信息量对DSM中的耦合集进行解耦的方法。针对实际设计任务调度的特点,结合耦合信息的割裂方法和迭代拓扑优化方法,提出了求解含有耦合关系的多项目调度问题的拓扑优化方法。并将该方法应用到船舶设计任务调度系统中。
Within the classical resource-constrained project scheduling problem(RCPSP),the activities of a project have to be scheduled such that the makespan(cost,etc.) of the project is minimized.RCPSP continues to be an active area of research attracting in recent years increasing interest from researchers and practitioners in the search for better solution procedures.The purpose of this paper is to introduce some new optimization algorithms to solve three kinds of RCPSP:classical RCPSP,preemptive RCPSP and resource-constrained multi-project scheduling problem(RCMPSP).
To solve the classical RCPSP,we introduce a particle swarm optimization(PSO) with dynamic inertia weight to adjust the inertia weight with the fitness of particles.Three PSO procedures based on different solution representations are propsed—Priority Value Based Particle Swarm Optimization(PVPSO),Priority Rule Based Particle Swarm Optimization (PRPSO),and Permutation Based Particle Swarm Optimization(PEPSO).PVPSO employs a new initialization method in which the heuristic information is added to the classical randomized method to improve the performance of the algorithm.PRPSO searches the optimal combination of priority rules based on PSO.PEPSO adopts the one-point crossover technique into the updating of particles,and makes use of a local search to help the particle escape the local optimum.Numerical results obtained from the PSPLIB show that these PSOs yields better results than several heuristic procedures presented in the literature
This paper provides the PSOs for the preemptive RCPSP.The experiments on Patterson show that the acitivity splitting can short the makespan of project.This paper develops a new wiest's justification in which the activity splitting is applied to predict whether the schedule could be improved.The new Wiest's justification with prediction(PWiest) was applied to improve the performance of algorithms,such as priority-rule heuristic method,particle swarm optimization and ant colony system and so on,for classic RCPSP,and the algorithms are approved with these experiments on PSPLIB.
Finally,the paper studies resource-constrained multi-project scheduling problem (RCMPSP) in which each project has a priority.For RCMPSP without coupling sets,we propose a topological travel optimization algorithm in which various influence factors are considered(such as resources constraints,successors,critical-path-activity-first,etc.).For RCMPSP with coupling sets,we present an uncouple method to deal with the coupling sets in DSM,which is used to represent the coupling relations between activities.The algorithms have been applied to the development of the Ship Design Plan Management System of Dalian Heavy Industry Ship Yard.
引文
[1]Blazewicz J,Lenstra J K,Rinnooy K A H G.Scheduling subject to resource constraints:classification and complexity.Discrete Applied Mathematics,1983,5(1):11-24.
[2]Conway R N,Maxwell W L,Miller L W.Theory of scheduling.MA:Addison Wesley,1967.
[3]Bake K R.Introduction to scheduling and sequencing.New York:John Wiley & Sons,1974.
[4]Gupta S K,Kyparisis J.Single machine scheduling research.OMEGA-Int' 1 Journal of Mgmt.Science,1987,15(3):207-227.
[5]Herroelen W,Demeulemeester E,De Reyck B.A classification scheme for project scheduling.Welglarz J.Project Scheduling:Recent Models,Algorithms,and Applications,1999:1-26.
[6]HSU Ch.Cheng.New heuristics for the multi-mode resource investment problem:[dissertation].Univ.of Massachusets Amherst,2001.
[7]Demeulemeester E,Herroelen W.A branch-and-bound procedure for the multiple resource-constrained project scheduling problem.Management Science,1992,38(12):1803-1818.
[8]Demeulemeester E,Herroelen W.New benchmark results for the resource-constrained project scheduling problem.Management Science,1997,43(11):1485-1492.
[9]Mingozzi A,Maniezzo V,Kicciardelli S et al.An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation.Management Science,1998,44(5):714-729.
[10]Patterson J H,Slow inski R,Talbot F B et al.An algorithm for a general class of precedence and resource constrained scheduling problem.Slowinski R and Weglarz J(eds).Advances in Project Scheduling.Amsterdam:Elsevier Publisher,1989:3-28.
[11]Brucker P,Knust S,Schoo A et al.A branch and bound algorithm for the resource-constrained project scheduling problem.European Journal of Operational Kesearch,1998,107(2):272-288.
[12]Brucker P,Knust S.A linear programming and constrained propagation-based lower bound for the RCPSP.European Journal of Operational Research,2000,127(2):355-362.
[13]Kolisch R.Serial and parallel resource-constrained project scheduling methods revisited:Theory and computation.European Journal of Operational Research,1996,90(2):320-333.
[14]Kelley J E.The critical-path method:Resources planning and scheduling,in:J.F.Muth and G.L.eds.Thompson,Industrial scheduling.Prentice-Hall,New Jersey,1963,347-365.
[15]Kolisch R.Project scheduling under resource constraints-efficient heuristics for several problem classes,Physica,Heidelberg,1995.
[16]Alvarez-Valdes R,Tamarit J M.Heuristic algorithms for resource-constrained project scheduling:A review and an empirical analysis,in:R.Slowinski,J.Weglarz(eds.),Advances in Project Scheduling.Elsevier,Amsterdam,the Netherlands,1989,113-134.
[17]Davis E,Patterson J.A comparison of heuristic and optimum solutions in resource-constrained project scheduling.Management Science,1975,21(8):944-955.
[18]Kolisch R.Efficient priority rules for the resource-constrained project scheduling problem.Journal of Operations Management,1996,14(3):179-192.
[19]齐东海,宋向群.工程项目进度管理.大连:大连理工大学出版社,1999.
[20]刘士新,王梦光,唐加福.资源受限工程调度问题的优化方法综述.控制与决策,2001,16(s):647-651
[21]Li K,Willis R.An iterative scheduling technique for resource-constrained project scheduling.European Journal of Operational Research,1992,56(3):370-379.
[22]Ozdamar L,Ulusoy G.A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis.European Journal of Operational Research,1996,89(2):400-407.
[23]Alvarez-Valdes R,Tamarit J M.Algoritmos heuri sticos deterministas y aleatorios en secuenciacon de proyectos con recursos limitados.Questiio,1989,13:173-191.
[24]Cooper D F.Heuristics for scheduling resource-constrained projects:An experimental investigation.Management Science,1976,22(11):1186-1194.
[25]Drexl A.Scheduling of project networks by job assignment.Management Science,1991,37(12):1590-1602.
[26]Kolisch R.Drexl A.Adaptive search for solving hard project scheduling problems.Naval Research Logistics,1996,43(1):23-40.
[27]Schirmer A,Riesenberg S.Parameterized heuristics for project scheduling-biased random sampling methods,Manuskripte aus den Instituten f(u|¨)r Betriebswirtschaftslehre 456,Universit(a|¨)t Kiel,Germany,1997.
[28]Kolisch R,Hartmarm S.Experimental investigation of heuristics for resource- constrained project scheduling:An update.European Journal of Operational Research,2006,174(1):23-37.
[29]Hartmann S,Kolisch R.Experimental evaluation of state-of-the-art heuristics for the resource constrained project scheduling problem.European Journal of Operational Research,2000,127(2):394-407.
[30]John L,Mustafa O,Evolutionary algorithms applied to project scheduling problems-a survey of the state-of-the art.International Journal of Prouction Research,2007,45(2),425-450.
[31]Hartmann S.A competitive genetic algorithm for resource-constrained project scheduling.Naval Research Logistics,1998,45(7):733-750.
[32]Hartmann S,A self-adapting genetic algorithm for project scheduling under resource constraints.Naval Research Logistics,2002,49(5):433-448.
[33]Alcaraz J,Maroto C,A robust genetic algorithm for resource allocation in project scheduling.Annals of Operations Research,2001,102(1-4):83-109.
[34]Coelho J,Tavares L.Comparative analysis of metaheuricstics for the resource constrained project scheduling problem.Department of civil engineering,Instituto Superior Tecnico,Portugal,2003.
[35]Vails V,Ballestin F,Quintanilla S.A hybrid genetic algorithm for the resource-constrained project scheduling problem.European Journal of Operational Research,2008,185(2):495-508.
[36]刘士新,王梦光,唐加福.一种求解资源受限工程调度问题的遗传算法.系统工程学报,2002,17(1):1-7.
[37]王宏,林丹,李敏强.一种求解资源受限项目调度问题的自适应遗传算法.系统工程,2005,23(12):99-102.
[38]Leon V J,Ramamoorthy B.Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling.OR Spektrum,1995,17(2/3):173-182.
[39]Hindi K S,Yang H,Fleszar K.An evolutionary algorithm for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,2002,6(5):512-518.
[40]Mendes J J M.A random key based genetic algorithm for the resource constrained project scheduling problem.Computers and Operations Research,2009,36(1):92-109.
[41]Debels D,Vanhoucke M.A de.composition-based genetic algorithm for the resource-constrained project-scheduling problem.Operations Research,2007,55(3):457-469.
[42]Goncalves J,Mendes J.A random key based genetic algorithm for the resource-constrained project scheduling problem.Departamento de Engenharia,Universidade do Porto,2003.
[43]Toklu Y C.Application of genetic algorithms to construction scheduling with or without resource constraints.Canadian Journal of Civil Engineering,2002,29(3):421-429.
[44]王振禄,蔡慧林.资源受限项目调度中基于邻域搜索的混合遗传算法.兰州交通大学学报(自然科学版),2005,24(3):12-14.
[45]Glover F,Laguna M,Marti R.Fundamentals of scatter search and path relinking.Control and Cybernetics,2000,29(3):653-684.
[46]Baar T,Brucker P,Knust S.Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem,in:Voss S,Martello S,Osman I,Roucairol C(Eds.),Meta-Heuristics:Advances and Trends in Local Search Paradigms for Optimization.Kluwer Academic Publishers,Boston,1998,1-8.
[47]Artigues C,Michelon P,Reusser S.Insertion techniques for static and dynamic resource-constrained project scheduling.European Journal of Operational Research,2003,149(2):249-267.
[48]Nonobe K,lbaraki T.Formulation and tabu search algorithm for the resource constrained project scheduling problem,in:Ribeiro C C,Hansen P(Eds.),Essays and Surveys in Metaheuristics.Kluwer Academic Publishers,2002,557-588.
[49]Thomas P R,Salhi S.A tabu search approach for the resource constrained project scheduling problem.Journal of Heuristics,1998,4(2):123-139.
[50]Aarts E H L,Korst J H M.Simulated annealing and boltzmarm machines:A stochastic approach to computing.Wiley,Chichester,1989.
[51]Boctor F F.Resource-constrained project scheduling by simulated annealing.International Journal of Production Research,1996,34(8):2335-2351.
[52]Bouleimen K,Lecocq H.A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem.Service de Robotique et Automatisation,Universite de Liege,1998.
[53]Vails V,Ballestyn F,Quintanilla S.Justification and RCPSP:A technique that pays.European Journal of Operational Research,2005,165(2):375-386.
[54]Patterson J H.Comparison of exact approaches for solving the multiple constrained resource project scheduling problem.Management Science,1984,30(7):854-867.
[55]Dorigo M,Optimization,Learning and natural algorithms:[dissertation],Politecnico di Milano,Italy,1992.
[56]Dorigo M,Maniezzo V,Colorni A,The ant system:Optimization by a colony of cooperating agents.IEEE Transactions on Systems,Man,and Cybernetics,1996,26(1):29-41.
[57]Merlde D,Middendorf M,Schmeck H.Ant colony optimization for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,2002,6(4):333-346.
[58]杨波,万仲平,尹德玉.资源约束项目排序问题的一种修正蚁群算法.工程数学学报,2007,24(3):437-445.
[59]郑超 高连生.蚁群算法在资源受限项目调度问题中的应用.计算机工程与应用,2005,27,205-209.
[60]Eberhart R,Kenndy J.A new optimizier using particle swarm theory.In:Proceedings of the Sixth International Symposium on Micro Machine and Human Science.New York:IEEE,1995,39-43.
[61]Kennedy J,Eberhart R.Particle swarm optimization.In:Proceedings of IEEE International Conference on Neural Networks,Vol 4,New York:IEEE,1995,1942-1948.
[62]Shi Y,Eberhart R.Parameter selection in particle swarm optimization.Proc of the 7th Annual conf on Evolutionary Programming.New York,1998,591-600.
[63]Kennedy J,Eberhart Russell C.A discrete binary version of the particle swarm algorithm.In:Proc.of the 1997 Conf.on Systems,Man,and Cybernetics.Piscataway:IEEE Press,1997,4104-4109.
[64]Zhang H,Li H,Tam C M.Particle swarm optimization for resource constrained project scheduling.International Journal of Project Management,2006,24(1):83-92.
[65]Zhang H,Li X D,Li H.Particle swarm optimization-based schemes for resource- constrained project scheduling.Automation in Construction,2005,14(3):393-404.
[66]王巍,赵国杰.粒子群优化在资源受限工程调度问题中的应用.哈尔滨工业大学学报,2007,39(4):669-672.
[67]单汨源,吴娟,吴亮红等.基于改进粒子群算法的资源受限项目进度研究.计算机工程与应用,2007,43(15):26-28.
[68]Rina A,Tiwari M K,Mukherjee S K.Artificial immune system based approach for solving resource constraint project scheduling problem.International journal of advanced manufacturing technology,2007,34(5-6):584-593
[69]曾茜,张著洪.免疫遗传算法及其对资源受限工期最短问题的应用.贵州大学学报(自然科学版),2007,24(3):268-273.
[70]Fleszar K,Hindi K.Solving the resource-constrained project scheduling problem by a variable neighbourhood search.European Journal of Operational Research,2004,155(2):402-413.
[71]Mladenovic N,Hansen P.Variable neighborhood search.Computers and Operations Research,1997,24(11):1097-1100.
[72]Palpant M,Artigues C,Michelon P.LSSPER:Solving the resource-constrained project scheduling problem with large neighbourhood search.Annals of Operations Research,2004,131:237-257.
[73]Valls V,Quintanilla M S,Ballestin F.Resource-constrained project scheduling:A critical reordering heuristic.European Journal of Operational Research,2003,149(2):282-301.
[74]Debels D,Reyck B De,Leus R et al.A hybrid scatter search/Electromagnetism meta-heuristic for project scheduling.European Journal of Operational Research,2006,169(2):638-653
[75]Valls V,Perez M A,Quintanilla M S.Heuristic performance in large resource- constrained projects.Department of statistics and operations research,University of Valencia,1992.
[76]Kochetov Y,Stolyar A.Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem.In:Proceedings of the 3rd International Workshop of Computer Science and Information Technologies,Russia,2003.
[77] Wiest J D. Some properties of schedules for large projects with limited resources. Operations Research, 1964,12(3): 395-418.
[78] Tormos P, Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research, 2001,102(1-4,) 65-81.
[79] Tormos P, Lova A. An efficient multi-pass heuristic for project scheduling with constrained resources. International Journal of Production Research, 2003,41(5): 1071-1086.
[80] Tormos P, Lova A. Integrating heuristics for resource constrained project scheduling: One step forward. Department of statistics and operations research, Universidad Politecnica de Valencia, 2003.
[81] Ozdamar L, Ulusoy G. An iterative local constraint based analysis for solving the resource-constrained project scheduling problem. Journal of Operations Management, 1996,14(3): 193-208.
[82] Ozdamar L, Ulusoy G. A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis. European Journal of Operational Research, 1996, 89(2): 400-407.
[83] Mohring R, Schulz A, Stork F, Uetz M. Solving project scheduling problems by minimum cut computations. Management Science, 2003,49(3): 330-350.
[84] Sprecher A. Network decomposition techniques for resource-constrained project scheduling. Journal of the Operational Research Society, 2002, 53(4): 405-414.
[85] Sprecher A. Scheduling resource-constrained projects competetively at modest memory requirements. Management Science, 2000,46: 710-723.
[86] Demeulemeester E L, Herroelen W S. Project scheduling - A research hand book International Series in Operations Research and Management Science. Kluwer Academic Publishers, 2002,49.
[87] Herroelen W, Demeulemeester E, DeReyck B. Resource constrained project scheduling: A survey of recent developments. Computers and Operations Research, 1998,25(4): 279-302.
[88] Davis E W, Patterson J H. A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling. Management Science, 1975, 21(8): 944-955.
[89] Alvarez-Valdes R, Tamarit J M. Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis, in: R. Slowinski, J. Weglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, the Netherlands, 1989,113-134.
[90] Brucker P, Drexl A, Mohring R et al. Resource-constrained project scheduling: Notation, Classification, Models, and methods. European Journal of Operational Research, 1999, 112(1): 3-41.
[91] Herroelen W, Demeulemeester E, DeReyck B. Resource constrained project scheduling: A survey of recent developments. Computers and Operations Research, 1998,25(4): 279-302.
[92] Icmeli O, Erenguc S S, Zappe C J. Project scheduling problems: A survey. International Journal of Operations & Production Management, 1993,13(11): 80-91.
[93] Kolisch R, Sprecher A, Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 1995,41(10): 1693-1703.
[94] Kolisch R, Padman R. An integrated survey of deterministic project scheduling. Omega, 2000, 29(3): 249-272.
[95] Ozdamar L, Ulusoy G. A survey on the resourceconstrained project scheduling problem. AIDE Transactions, 1995, 27: 574-586.
[96] Weglarz J. ed. Project Scheduling. Recent models, Algorithms and applications. Kluwer Academic Publishers, 1999.
[97]Kaplan L A.Resource-constrained project scheduling with preemption of jobs:[dissertation],Michigan:University of Michigan,1988.
[98]Kaplan,L A.Resource-constrained project scheduling with setup times.Department of Management,University of Tenessee,Knoxville,1991.
[99]Demeulemeester E,Herroelen W.An efficient optimal procedure for the preemptive resource-constrained project scheduling problem.European Journal of Operational Research,1996,90(2):334-348.
[100]Bock D B,Patterson J H.A comparison of due date setting,resource assignment and job preemption heuristics for the multiproject scheduling problem.Decision Sciences,1990,21(2):387-402.
[101]Tsubakitani S,Deckro,R F.A heuristic for multiproject scheduling with limited resources in the housing industry.European Journal of Operational Research,1990,49(1):80-91.
[102]雒兴刚,汪定伟,唐加福.任务拆分项目调度问题.东北大学学报(自然科学版),2006,27(9):961-964.
[103]Ballestin F,Valls V,Quintanilla S.Pre-emption in resource-constrained project scheduling.European Journal of Operational Research,2008,189(3):1136-1152.
[104]Fendley L G.Towards the development of a complete multi-project scheduling system.Journal of Industrial Engineering,1968,19(10):505-515.
[105]Pritsker A B.Muti-project scheduling with limited resources:A zero-one programming approach.Management Science,1969,16(1):93-108.
[106]Kurtulus I,Davis E W.Multi-project scheduling:Categorization of heuristic rules performance.Management Science,1982,28(2):161-172.
[107]Davis C,Cochrane S R.Optimization of furore manpower requirements in a multi-discipline consultancy.Construction Management and Economics,1987,5(1):45-56.
[108]Shigeru T,Richard F D.A heuristic for multi-project scheduling with limited resources in the housing industry.European Journal of Operational Research,1990,49(1):80-91.
[109]Soo-Y K,Leachman Robert C.Multi-project scheduling with explicit lateness costs.IIE Transactions,1993,25(2):34-43.
[110]Speranza M G,Verceilis C.Hierarchical models for multi-project planning and scheduling.European Journal of Operational Research,1993,64(2):312-325.
[111]John D,Vincent A M.Evaluating project scheduling and due date assignment procedures:An experimental analysis.Management Science,1998,34(1):101-118.
[112]寿涌毅.资源约束下多项目调度的迭代算法.浙江大学学报(工学版),2004,38(8):1095-1099.
[113]方炜,欧立雄.多项目环境下新产品研发项目资源分配问题研究.管理工程学报,2005,19(s):6-10.
[114]谈烨,仲伟俊,徐南荣.多种资源受限多项目排序问题的两层决策方法.系统工程理论与实践,2001,21(2):1-5.
[115]高雷阜.资源分配的多目标优化动态规划模型.辽宁工程技术大学学报(自然科学版),2001,20(5):679-681.
[116]周永华,陈禹六.多项目环境下经营过程配置优化.计算机集成制造系统,2003,9(6):436-443.
[117]郭研,宁宣熙.利用遗传算法求解多项目资源平衡问题.系统工程理论与实践,2005,(10):78-82.
[118]廖仁,陈庆新,毛宁.资源约束下多项目调度的启发式算法.管理工程学报,2002,16(S):100-103.
[119]James P,Chappell.The application of criticial path methodology to the management of ship design programs.Marine Technology,1991,28(3):113-128.
[120]Kromker M,Thoben K D.Re-engineering the ship pre-design process.Computers in Industry,1996,31:143-153.
[121]Park Kyungchul,Lee Kyungsik,Park Sungsoo et al.Modeling and solving the spatial block scheduling problem in a shipbuilding company.Computers and Industrial Engineering,1996,30(3):357-364.
[122]Lee J K,Lee K J,Park H K et al.Developing scheduling systems for Daewoo shipbuilding:Das project.European Journal of Operational Research,1997,97(2):380-395.
[123]刘建峰,秦士元,应长春.船体分段制造日程计划的模拟与优化.中国造船.2000,41(4):13-21.
[124]Richard L S,Jin H P,David E.Development of ship detail design expert system.Journal of Ship Production.2002,18(1):8-12.
[125]李国顺,赵耀,严俊.基于J2EE的船舶设计过程管理系统实现.船海工程.2001,S1:122-126.
[126]袁华,赵耀,严俊.基于工作流技术的船舶产品设计过程管理系统.船海工程,2001,S1:122-126.
[127]万水生,郭亨翔,华玮.船舶设计流程控制.船舶设计通讯.2002,105:71-81,84.
[128]金朝光.船舶建造工程管理及供应链一体化研究:(博士学位论文).大连:大连理工大学,2002.
[129]王能建,邱长华.支持协同设计的船舶设计过程模型研究.中国造船.2005,46(1):66-70.
[130]李忠凯 基于工作流的船舶办公自动化系统的研究:(博士学位论文).大连:大连海事大学,2005.
[131]贺泽.船舶协同设计及智力资源配置方法研究:(博士学位论文).哈尔滨:哈尔滨工程大学,2006.
[132]刘钦辉,船舶协同设计关键技术研究:(硕士学位论文).哈尔滨:哈尔滨工程大学,2006.
[133]Sprecher A,Kolisch R,Drexl A.Semi-active,active and non-delay schedules for the resources-constrained for the resource-constrained project scheduling problem.European Journal of Operational Research,1995,80(1):94-102.
[134]Davis E.W.An exact algorithm for the multiple constrained project scheduling problem:[dissertation],Yale University,1969.
[135]Patterson J H.A comparison of exact approaches for solving the multiple constrained resource project scheduling problem.Management Science,1984,30(7):854-867.
[136]Alvarez-Ualdes R,Tamarit J M.Heuristic algorithms for resource- constrained project scheduling:a review and an empirical analysis.Slowinski R.,Wglarz J.Advances in project scheduling.Amsterdam,Elsevier,1989:113-134.
[137]Kolisch R,Sprecher A,P SPLIB-a project scheduling problem library.European Journal of Operation Research,1997,96(1):205-216.
[138]刘宇,覃征,史析文.简约粒子群优化算法.西安交通大学学报,2006,40(8):883-887. 2006.
[140] Wachowiak M, Smolikova R, Zheng Y F, et al. An approach to multimodal biomediacal image registration utilizating particle swarm optimization. IEEE Transaction on Evolutionary Computation, 2004, 8(3): 289-301.
[141] Yoshida H, Kawata K, Fukuyama Y, et al. A particle swarm optimization for reactive power and voltage control considering voltage security assessment. IEEE Transactions on Power Systems, 2000, 15(4): 1232-1239.
[142] Eberhart R, Shi Y. Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation. Seoul, South Korea, 2001: 81-86.
[143] Shi Y H, Eberhart RC.A modified particle swarm optimizer. 1998 IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, 69-73,1998.
[144] Clerc M, Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58-73.
[145] Fan H Y, Shi Y H. Study of Vmax of the particle swarm optimization algorithm. Proceedings of the Workshop on PSO. Indianapolis: Purdue School of Engineering and Technology, IN2PUI, 2001.
[146] Kennedy J, Mendes R. Population structure and particle swarm performance. In: Proceedings of the 2002 Congress on Evolutionary Computation, Honolulu, HI USA, 2002: 1671-1676.
[147] Kennedy J. Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. eds. Proceedings of IEEE Congress on Evolutionary Computation. Washington, USA, 1999: 1931-1938.
[148] Suganthan P N. Particle swarm optimizer with neighborhood operator. ed. Proceedings of the Congress on Evolutionary Computation. Washington, USA, 1999: 1958-1961.
[149] Parsopoulos K E, Vrahatis M N. A unified particle swarm optimization scheme. Lecture Notes in Computer Science, 2005, 3449: 590-599.
[150] Mendes R, Kennedy J, Neves J. The fully informed particle swarm: Simpler, may be better. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 84-89.
[151] Peram T, Veeramachaneni K, Mohan C K. Fitness-distance-ratio based particle swarm optimization. In: Proceedings of Swarm Intelligence Symposium. Indianapolis, 2003, 174-181.
[152] Angeline P J. Using selection to improve particle swarm optimization. In: Proceedings of IEEE World Congress on Computational Intelligence. Anchorage, AK, 1998, 84-89.
[153] Stacey A, Jancic M, Grundy I. Particle swarm optimization with mutation. In: Proceedings of the 2003 Congress on Evolutionary Computation. Canberra, 2003, 1425-1430.
[154] Higashi N, Iha H. Particle swarm optimization with gaussian mutation. In: Proceedings of the IEEE Swarm Intelligence Symposium (SIS 2003). Indianapolis, Indiana, 2003, 72-79
[155] Lovbjerg M, Rasmussen T K, Krink T. Hybrid particle swarm optimizer with breeding and subpopulation. In: Proceedings of the 3rd Genetic Evolutionary Computation. San Francisco, CA, 2001,469-476
[156] Van den Bergh F, Engelbrecht A P. A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 225-239.
[157]Beasley D,Bull D,Martin R.A sequential niche technique for multimodal function optimization.Evolutionary Computation,1993,101-125.
[158]Parsopoulos K E,Plagianakos V P,Magoulas G D.Improving particle swarm optimizer by function "Stretching".Hadjisawas N,Pardalos P.Advances in Convex Analysis and Global Optimization.The Netherlands:Kluwer Academic Publishers,2001,445-457.
[159]Krink T,Vesterstrom J S,Riget J.Particle swarm optimisation with spatial particle extension.In:Proceedings of the 2002 Congress on Evolutionary Computation.Honolulu,HI USA,2002,1474-1479
[160]Xie X,Zhang W,Yang Z.A dissipative particle swarm optimization.In:Proceedings of the Congress on Evolutionary Computation.Honolulu,HI,2002,1456-1461
[161]Parsopoulos K E,Vrahatis M N.On the computation of all global minimizers through particle swarm optimization.IEEE Transactions on Evolutionary Computation,2004,8(3):211-224.
[162]Shi Y,Eberhart R.Empirical study of particle swarm optimization.International Conference on Evolutionary Computation.Washington,USA:IEEE,1999,1945-1950.
[163]Shi Y,Eberhart R.Fuzzy adaptive particle swarm optimization.The IEEE Congress on Evolutionary Computation.San Francisco,USA:IEEE,2001,101-106.
[164]Eberhart R,Shi Y.Tracking and optimizing dynamic systems with particle swarms.The IEEE Congress on Evolutionary Computation.San Francisco,USA:IEEE,2001,94-100.
[165]Chatterjeea A,Siarryb P.Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization.Computers & Operations Research,2006,33(3):859-871.
[166]Jiao B,Lian Z G,Gu X S.A dynamic inertia weight particle swarm optimization algorithm.Chaos,Solitons and Fractals,2005,25(5):1261-1271.
[167]Yang X M,Yuan J S,Mao H N.A modified particle swarm optimizer with dynamic adaptation.Applied Mathematics and Computation,2007,189(2):1205-1213.
[168]Liu B,Wang L,Jin Y H,Tang F et al.Improved particle swarm optimization combined with chaos.Chaos,Solitons and Fractals,2005,25(5) 1261-1271.
[169]陈贵敏,贾建援,韩琪.粒子群优化算法的惯性权值递减策略研究.西安交通大学学报,2006,40(1):53-56.
[170]Xueming Yang,Jinsha Yuan,Jiangye Yuan et al.A modified particle swarm optimizer with dynamic adaptation.Applied Mathematics and Computation,2007,189(2):1205-1213.
[171]张选平,杜玉平,秦国强等.一种动态改变惯性权的自适应粒子群算法.西安交通大学学报,2005,29(10):1039-1042.
[172]路克中,王汝传,帅小应.保持粒子活性的改进粒子群优化算法.计算机工程与应用,2007,43(11):25-38.
[173]Schirmer A.Case-based reasoning and improved adaptive search for project scheduling.Naval Research Logistics,2000,47(3):201-222.
[174]Klein R,Scholl A.Computing lower bounds by destructive improvement:An application to resource-constrained project scheduling.European Journal of Operational Research,1999,112(2):322-346.
[175]Vails V,Ballestin F,Quintanilla S.Justification technique generalizations.International Series in Operations Research & Management Science,2006,12:204-223.
[176]Bautista J,Pereira P.Ant colonies for the RCPS problem.Lectures on Computers Science,2002,2504:257-268.
[177]Liang Y C.An ant colony approach to resource-constrained project scheduling problems.Proceeding of the Fifth Asia-Pacific Industrial and Management System Conference,2004.
[178]Gambardella L M,Taillard E D,Dorigo M.Ant colonies for th.e quadratic assignment problem,Journal of the Operational Research Society,1999,50(2):167-176.
[179]Bruno P.数据结构与算法—面向对象的C++设计模式.北京:电子工业出版社,2003.
[180]Steward D V.The design structure system:A method for managing the design of complex system.IEEE Transactions on Engineering Management,1981,28(3):71-74.
[181]徐晓刚,刘伟,李明等.基于DSM的产品开发流程再造.机械设计与制造工程,2001,30(4):34-36.
[182]曹健,张友良,赵海燕.并行设计耦合任务集的识别方法.机械科学与技术,1999,18(2):336-338.
[183]梅成刚,肖人彬.复杂设计过程的信息建模及重组.机械科学与技术,2004,23(1):105-109.
[184]Zhuang M,Yassine A.Task Scheduling of Parallel development Projects using genetic algorithms.2004 American society of mechanical engineers design automation conference,Salt Lake City,Utah USA:ASME,2004.
[2]Conway R N,Maxwell W L,Miller L W.Theory of scheduling.MA:Addison Wesley,1967.
[3]Bake K R.Introduction to scheduling and sequencing.New York:John Wiley & Sons,1974.
[4]Gupta S K,Kyparisis J.Single machine scheduling research.OMEGA-Int' 1 Journal of Mgmt.Science,1987,15(3):207-227.
[5]Herroelen W,Demeulemeester E,De Reyck B.A classification scheme for project scheduling.Welglarz J.Project Scheduling:Recent Models,Algorithms,and Applications,1999:1-26.
[6]HSU Ch.Cheng.New heuristics for the multi-mode resource investment problem:[dissertation].Univ.of Massachusets Amherst,2001.
[7]Demeulemeester E,Herroelen W.A branch-and-bound procedure for the multiple resource-constrained project scheduling problem.Management Science,1992,38(12):1803-1818.
[8]Demeulemeester E,Herroelen W.New benchmark results for the resource-constrained project scheduling problem.Management Science,1997,43(11):1485-1492.
[9]Mingozzi A,Maniezzo V,Kicciardelli S et al.An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation.Management Science,1998,44(5):714-729.
[10]Patterson J H,Slow inski R,Talbot F B et al.An algorithm for a general class of precedence and resource constrained scheduling problem.Slowinski R and Weglarz J(eds).Advances in Project Scheduling.Amsterdam:Elsevier Publisher,1989:3-28.
[11]Brucker P,Knust S,Schoo A et al.A branch and bound algorithm for the resource-constrained project scheduling problem.European Journal of Operational Kesearch,1998,107(2):272-288.
[12]Brucker P,Knust S.A linear programming and constrained propagation-based lower bound for the RCPSP.European Journal of Operational Research,2000,127(2):355-362.
[13]Kolisch R.Serial and parallel resource-constrained project scheduling methods revisited:Theory and computation.European Journal of Operational Research,1996,90(2):320-333.
[14]Kelley J E.The critical-path method:Resources planning and scheduling,in:J.F.Muth and G.L.eds.Thompson,Industrial scheduling.Prentice-Hall,New Jersey,1963,347-365.
[15]Kolisch R.Project scheduling under resource constraints-efficient heuristics for several problem classes,Physica,Heidelberg,1995.
[16]Alvarez-Valdes R,Tamarit J M.Heuristic algorithms for resource-constrained project scheduling:A review and an empirical analysis,in:R.Slowinski,J.Weglarz(eds.),Advances in Project Scheduling.Elsevier,Amsterdam,the Netherlands,1989,113-134.
[17]Davis E,Patterson J.A comparison of heuristic and optimum solutions in resource-constrained project scheduling.Management Science,1975,21(8):944-955.
[18]Kolisch R.Efficient priority rules for the resource-constrained project scheduling problem.Journal of Operations Management,1996,14(3):179-192.
[19]齐东海,宋向群.工程项目进度管理.大连:大连理工大学出版社,1999.
[20]刘士新,王梦光,唐加福.资源受限工程调度问题的优化方法综述.控制与决策,2001,16(s):647-651
[21]Li K,Willis R.An iterative scheduling technique for resource-constrained project scheduling.European Journal of Operational Research,1992,56(3):370-379.
[22]Ozdamar L,Ulusoy G.A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis.European Journal of Operational Research,1996,89(2):400-407.
[23]Alvarez-Valdes R,Tamarit J M.Algoritmos heuri sticos deterministas y aleatorios en secuenciacon de proyectos con recursos limitados.Questiio,1989,13:173-191.
[24]Cooper D F.Heuristics for scheduling resource-constrained projects:An experimental investigation.Management Science,1976,22(11):1186-1194.
[25]Drexl A.Scheduling of project networks by job assignment.Management Science,1991,37(12):1590-1602.
[26]Kolisch R.Drexl A.Adaptive search for solving hard project scheduling problems.Naval Research Logistics,1996,43(1):23-40.
[27]Schirmer A,Riesenberg S.Parameterized heuristics for project scheduling-biased random sampling methods,Manuskripte aus den Instituten f(u|¨)r Betriebswirtschaftslehre 456,Universit(a|¨)t Kiel,Germany,1997.
[28]Kolisch R,Hartmarm S.Experimental investigation of heuristics for resource- constrained project scheduling:An update.European Journal of Operational Research,2006,174(1):23-37.
[29]Hartmann S,Kolisch R.Experimental evaluation of state-of-the-art heuristics for the resource constrained project scheduling problem.European Journal of Operational Research,2000,127(2):394-407.
[30]John L,Mustafa O,Evolutionary algorithms applied to project scheduling problems-a survey of the state-of-the art.International Journal of Prouction Research,2007,45(2),425-450.
[31]Hartmann S.A competitive genetic algorithm for resource-constrained project scheduling.Naval Research Logistics,1998,45(7):733-750.
[32]Hartmann S,A self-adapting genetic algorithm for project scheduling under resource constraints.Naval Research Logistics,2002,49(5):433-448.
[33]Alcaraz J,Maroto C,A robust genetic algorithm for resource allocation in project scheduling.Annals of Operations Research,2001,102(1-4):83-109.
[34]Coelho J,Tavares L.Comparative analysis of metaheuricstics for the resource constrained project scheduling problem.Department of civil engineering,Instituto Superior Tecnico,Portugal,2003.
[35]Vails V,Ballestin F,Quintanilla S.A hybrid genetic algorithm for the resource-constrained project scheduling problem.European Journal of Operational Research,2008,185(2):495-508.
[36]刘士新,王梦光,唐加福.一种求解资源受限工程调度问题的遗传算法.系统工程学报,2002,17(1):1-7.
[37]王宏,林丹,李敏强.一种求解资源受限项目调度问题的自适应遗传算法.系统工程,2005,23(12):99-102.
[38]Leon V J,Ramamoorthy B.Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling.OR Spektrum,1995,17(2/3):173-182.
[39]Hindi K S,Yang H,Fleszar K.An evolutionary algorithm for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,2002,6(5):512-518.
[40]Mendes J J M.A random key based genetic algorithm for the resource constrained project scheduling problem.Computers and Operations Research,2009,36(1):92-109.
[41]Debels D,Vanhoucke M.A de.composition-based genetic algorithm for the resource-constrained project-scheduling problem.Operations Research,2007,55(3):457-469.
[42]Goncalves J,Mendes J.A random key based genetic algorithm for the resource-constrained project scheduling problem.Departamento de Engenharia,Universidade do Porto,2003.
[43]Toklu Y C.Application of genetic algorithms to construction scheduling with or without resource constraints.Canadian Journal of Civil Engineering,2002,29(3):421-429.
[44]王振禄,蔡慧林.资源受限项目调度中基于邻域搜索的混合遗传算法.兰州交通大学学报(自然科学版),2005,24(3):12-14.
[45]Glover F,Laguna M,Marti R.Fundamentals of scatter search and path relinking.Control and Cybernetics,2000,29(3):653-684.
[46]Baar T,Brucker P,Knust S.Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem,in:Voss S,Martello S,Osman I,Roucairol C(Eds.),Meta-Heuristics:Advances and Trends in Local Search Paradigms for Optimization.Kluwer Academic Publishers,Boston,1998,1-8.
[47]Artigues C,Michelon P,Reusser S.Insertion techniques for static and dynamic resource-constrained project scheduling.European Journal of Operational Research,2003,149(2):249-267.
[48]Nonobe K,lbaraki T.Formulation and tabu search algorithm for the resource constrained project scheduling problem,in:Ribeiro C C,Hansen P(Eds.),Essays and Surveys in Metaheuristics.Kluwer Academic Publishers,2002,557-588.
[49]Thomas P R,Salhi S.A tabu search approach for the resource constrained project scheduling problem.Journal of Heuristics,1998,4(2):123-139.
[50]Aarts E H L,Korst J H M.Simulated annealing and boltzmarm machines:A stochastic approach to computing.Wiley,Chichester,1989.
[51]Boctor F F.Resource-constrained project scheduling by simulated annealing.International Journal of Production Research,1996,34(8):2335-2351.
[52]Bouleimen K,Lecocq H.A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem.Service de Robotique et Automatisation,Universite de Liege,1998.
[53]Vails V,Ballestyn F,Quintanilla S.Justification and RCPSP:A technique that pays.European Journal of Operational Research,2005,165(2):375-386.
[54]Patterson J H.Comparison of exact approaches for solving the multiple constrained resource project scheduling problem.Management Science,1984,30(7):854-867.
[55]Dorigo M,Optimization,Learning and natural algorithms:[dissertation],Politecnico di Milano,Italy,1992.
[56]Dorigo M,Maniezzo V,Colorni A,The ant system:Optimization by a colony of cooperating agents.IEEE Transactions on Systems,Man,and Cybernetics,1996,26(1):29-41.
[57]Merlde D,Middendorf M,Schmeck H.Ant colony optimization for resource-constrained project scheduling.IEEE Transactions on Evolutionary Computation,2002,6(4):333-346.
[58]杨波,万仲平,尹德玉.资源约束项目排序问题的一种修正蚁群算法.工程数学学报,2007,24(3):437-445.
[59]郑超 高连生.蚁群算法在资源受限项目调度问题中的应用.计算机工程与应用,2005,27,205-209.
[60]Eberhart R,Kenndy J.A new optimizier using particle swarm theory.In:Proceedings of the Sixth International Symposium on Micro Machine and Human Science.New York:IEEE,1995,39-43.
[61]Kennedy J,Eberhart R.Particle swarm optimization.In:Proceedings of IEEE International Conference on Neural Networks,Vol 4,New York:IEEE,1995,1942-1948.
[62]Shi Y,Eberhart R.Parameter selection in particle swarm optimization.Proc of the 7th Annual conf on Evolutionary Programming.New York,1998,591-600.
[63]Kennedy J,Eberhart Russell C.A discrete binary version of the particle swarm algorithm.In:Proc.of the 1997 Conf.on Systems,Man,and Cybernetics.Piscataway:IEEE Press,1997,4104-4109.
[64]Zhang H,Li H,Tam C M.Particle swarm optimization for resource constrained project scheduling.International Journal of Project Management,2006,24(1):83-92.
[65]Zhang H,Li X D,Li H.Particle swarm optimization-based schemes for resource- constrained project scheduling.Automation in Construction,2005,14(3):393-404.
[66]王巍,赵国杰.粒子群优化在资源受限工程调度问题中的应用.哈尔滨工业大学学报,2007,39(4):669-672.
[67]单汨源,吴娟,吴亮红等.基于改进粒子群算法的资源受限项目进度研究.计算机工程与应用,2007,43(15):26-28.
[68]Rina A,Tiwari M K,Mukherjee S K.Artificial immune system based approach for solving resource constraint project scheduling problem.International journal of advanced manufacturing technology,2007,34(5-6):584-593
[69]曾茜,张著洪.免疫遗传算法及其对资源受限工期最短问题的应用.贵州大学学报(自然科学版),2007,24(3):268-273.
[70]Fleszar K,Hindi K.Solving the resource-constrained project scheduling problem by a variable neighbourhood search.European Journal of Operational Research,2004,155(2):402-413.
[71]Mladenovic N,Hansen P.Variable neighborhood search.Computers and Operations Research,1997,24(11):1097-1100.
[72]Palpant M,Artigues C,Michelon P.LSSPER:Solving the resource-constrained project scheduling problem with large neighbourhood search.Annals of Operations Research,2004,131:237-257.
[73]Valls V,Quintanilla M S,Ballestin F.Resource-constrained project scheduling:A critical reordering heuristic.European Journal of Operational Research,2003,149(2):282-301.
[74]Debels D,Reyck B De,Leus R et al.A hybrid scatter search/Electromagnetism meta-heuristic for project scheduling.European Journal of Operational Research,2006,169(2):638-653
[75]Valls V,Perez M A,Quintanilla M S.Heuristic performance in large resource- constrained projects.Department of statistics and operations research,University of Valencia,1992.
[76]Kochetov Y,Stolyar A.Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem.In:Proceedings of the 3rd International Workshop of Computer Science and Information Technologies,Russia,2003.
[77] Wiest J D. Some properties of schedules for large projects with limited resources. Operations Research, 1964,12(3): 395-418.
[78] Tormos P, Lova A. A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research, 2001,102(1-4,) 65-81.
[79] Tormos P, Lova A. An efficient multi-pass heuristic for project scheduling with constrained resources. International Journal of Production Research, 2003,41(5): 1071-1086.
[80] Tormos P, Lova A. Integrating heuristics for resource constrained project scheduling: One step forward. Department of statistics and operations research, Universidad Politecnica de Valencia, 2003.
[81] Ozdamar L, Ulusoy G. An iterative local constraint based analysis for solving the resource-constrained project scheduling problem. Journal of Operations Management, 1996,14(3): 193-208.
[82] Ozdamar L, Ulusoy G. A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis. European Journal of Operational Research, 1996, 89(2): 400-407.
[83] Mohring R, Schulz A, Stork F, Uetz M. Solving project scheduling problems by minimum cut computations. Management Science, 2003,49(3): 330-350.
[84] Sprecher A. Network decomposition techniques for resource-constrained project scheduling. Journal of the Operational Research Society, 2002, 53(4): 405-414.
[85] Sprecher A. Scheduling resource-constrained projects competetively at modest memory requirements. Management Science, 2000,46: 710-723.
[86] Demeulemeester E L, Herroelen W S. Project scheduling - A research hand book International Series in Operations Research and Management Science. Kluwer Academic Publishers, 2002,49.
[87] Herroelen W, Demeulemeester E, DeReyck B. Resource constrained project scheduling: A survey of recent developments. Computers and Operations Research, 1998,25(4): 279-302.
[88] Davis E W, Patterson J H. A Comparison of Heuristic and Optimum Solutions in Resource-Constrained Project Scheduling. Management Science, 1975, 21(8): 944-955.
[89] Alvarez-Valdes R, Tamarit J M. Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis, in: R. Slowinski, J. Weglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, the Netherlands, 1989,113-134.
[90] Brucker P, Drexl A, Mohring R et al. Resource-constrained project scheduling: Notation, Classification, Models, and methods. European Journal of Operational Research, 1999, 112(1): 3-41.
[91] Herroelen W, Demeulemeester E, DeReyck B. Resource constrained project scheduling: A survey of recent developments. Computers and Operations Research, 1998,25(4): 279-302.
[92] Icmeli O, Erenguc S S, Zappe C J. Project scheduling problems: A survey. International Journal of Operations & Production Management, 1993,13(11): 80-91.
[93] Kolisch R, Sprecher A, Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 1995,41(10): 1693-1703.
[94] Kolisch R, Padman R. An integrated survey of deterministic project scheduling. Omega, 2000, 29(3): 249-272.
[95] Ozdamar L, Ulusoy G. A survey on the resourceconstrained project scheduling problem. AIDE Transactions, 1995, 27: 574-586.
[96] Weglarz J. ed. Project Scheduling. Recent models, Algorithms and applications. Kluwer Academic Publishers, 1999.
[97]Kaplan L A.Resource-constrained project scheduling with preemption of jobs:[dissertation],Michigan:University of Michigan,1988.
[98]Kaplan,L A.Resource-constrained project scheduling with setup times.Department of Management,University of Tenessee,Knoxville,1991.
[99]Demeulemeester E,Herroelen W.An efficient optimal procedure for the preemptive resource-constrained project scheduling problem.European Journal of Operational Research,1996,90(2):334-348.
[100]Bock D B,Patterson J H.A comparison of due date setting,resource assignment and job preemption heuristics for the multiproject scheduling problem.Decision Sciences,1990,21(2):387-402.
[101]Tsubakitani S,Deckro,R F.A heuristic for multiproject scheduling with limited resources in the housing industry.European Journal of Operational Research,1990,49(1):80-91.
[102]雒兴刚,汪定伟,唐加福.任务拆分项目调度问题.东北大学学报(自然科学版),2006,27(9):961-964.
[103]Ballestin F,Valls V,Quintanilla S.Pre-emption in resource-constrained project scheduling.European Journal of Operational Research,2008,189(3):1136-1152.
[104]Fendley L G.Towards the development of a complete multi-project scheduling system.Journal of Industrial Engineering,1968,19(10):505-515.
[105]Pritsker A B.Muti-project scheduling with limited resources:A zero-one programming approach.Management Science,1969,16(1):93-108.
[106]Kurtulus I,Davis E W.Multi-project scheduling:Categorization of heuristic rules performance.Management Science,1982,28(2):161-172.
[107]Davis C,Cochrane S R.Optimization of furore manpower requirements in a multi-discipline consultancy.Construction Management and Economics,1987,5(1):45-56.
[108]Shigeru T,Richard F D.A heuristic for multi-project scheduling with limited resources in the housing industry.European Journal of Operational Research,1990,49(1):80-91.
[109]Soo-Y K,Leachman Robert C.Multi-project scheduling with explicit lateness costs.IIE Transactions,1993,25(2):34-43.
[110]Speranza M G,Verceilis C.Hierarchical models for multi-project planning and scheduling.European Journal of Operational Research,1993,64(2):312-325.
[111]John D,Vincent A M.Evaluating project scheduling and due date assignment procedures:An experimental analysis.Management Science,1998,34(1):101-118.
[112]寿涌毅.资源约束下多项目调度的迭代算法.浙江大学学报(工学版),2004,38(8):1095-1099.
[113]方炜,欧立雄.多项目环境下新产品研发项目资源分配问题研究.管理工程学报,2005,19(s):6-10.
[114]谈烨,仲伟俊,徐南荣.多种资源受限多项目排序问题的两层决策方法.系统工程理论与实践,2001,21(2):1-5.
[115]高雷阜.资源分配的多目标优化动态规划模型.辽宁工程技术大学学报(自然科学版),2001,20(5):679-681.
[116]周永华,陈禹六.多项目环境下经营过程配置优化.计算机集成制造系统,2003,9(6):436-443.
[117]郭研,宁宣熙.利用遗传算法求解多项目资源平衡问题.系统工程理论与实践,2005,(10):78-82.
[118]廖仁,陈庆新,毛宁.资源约束下多项目调度的启发式算法.管理工程学报,2002,16(S):100-103.
[119]James P,Chappell.The application of criticial path methodology to the management of ship design programs.Marine Technology,1991,28(3):113-128.
[120]Kromker M,Thoben K D.Re-engineering the ship pre-design process.Computers in Industry,1996,31:143-153.
[121]Park Kyungchul,Lee Kyungsik,Park Sungsoo et al.Modeling and solving the spatial block scheduling problem in a shipbuilding company.Computers and Industrial Engineering,1996,30(3):357-364.
[122]Lee J K,Lee K J,Park H K et al.Developing scheduling systems for Daewoo shipbuilding:Das project.European Journal of Operational Research,1997,97(2):380-395.
[123]刘建峰,秦士元,应长春.船体分段制造日程计划的模拟与优化.中国造船.2000,41(4):13-21.
[124]Richard L S,Jin H P,David E.Development of ship detail design expert system.Journal of Ship Production.2002,18(1):8-12.
[125]李国顺,赵耀,严俊.基于J2EE的船舶设计过程管理系统实现.船海工程.2001,S1:122-126.
[126]袁华,赵耀,严俊.基于工作流技术的船舶产品设计过程管理系统.船海工程,2001,S1:122-126.
[127]万水生,郭亨翔,华玮.船舶设计流程控制.船舶设计通讯.2002,105:71-81,84.
[128]金朝光.船舶建造工程管理及供应链一体化研究:(博士学位论文).大连:大连理工大学,2002.
[129]王能建,邱长华.支持协同设计的船舶设计过程模型研究.中国造船.2005,46(1):66-70.
[130]李忠凯 基于工作流的船舶办公自动化系统的研究:(博士学位论文).大连:大连海事大学,2005.
[131]贺泽.船舶协同设计及智力资源配置方法研究:(博士学位论文).哈尔滨:哈尔滨工程大学,2006.
[132]刘钦辉,船舶协同设计关键技术研究:(硕士学位论文).哈尔滨:哈尔滨工程大学,2006.
[133]Sprecher A,Kolisch R,Drexl A.Semi-active,active and non-delay schedules for the resources-constrained for the resource-constrained project scheduling problem.European Journal of Operational Research,1995,80(1):94-102.
[134]Davis E.W.An exact algorithm for the multiple constrained project scheduling problem:[dissertation],Yale University,1969.
[135]Patterson J H.A comparison of exact approaches for solving the multiple constrained resource project scheduling problem.Management Science,1984,30(7):854-867.
[136]Alvarez-Ualdes R,Tamarit J M.Heuristic algorithms for resource- constrained project scheduling:a review and an empirical analysis.Slowinski R.,Wglarz J.Advances in project scheduling.Amsterdam,Elsevier,1989:113-134.
[137]Kolisch R,Sprecher A,P SPLIB-a project scheduling problem library.European Journal of Operation Research,1997,96(1):205-216.
[138]刘宇,覃征,史析文.简约粒子群优化算法.西安交通大学学报,2006,40(8):883-887. 2006.
[140] Wachowiak M, Smolikova R, Zheng Y F, et al. An approach to multimodal biomediacal image registration utilizating particle swarm optimization. IEEE Transaction on Evolutionary Computation, 2004, 8(3): 289-301.
[141] Yoshida H, Kawata K, Fukuyama Y, et al. A particle swarm optimization for reactive power and voltage control considering voltage security assessment. IEEE Transactions on Power Systems, 2000, 15(4): 1232-1239.
[142] Eberhart R, Shi Y. Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation. Seoul, South Korea, 2001: 81-86.
[143] Shi Y H, Eberhart RC.A modified particle swarm optimizer. 1998 IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, 69-73,1998.
[144] Clerc M, Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 2002, 6(1): 58-73.
[145] Fan H Y, Shi Y H. Study of Vmax of the particle swarm optimization algorithm. Proceedings of the Workshop on PSO. Indianapolis: Purdue School of Engineering and Technology, IN2PUI, 2001.
[146] Kennedy J, Mendes R. Population structure and particle swarm performance. In: Proceedings of the 2002 Congress on Evolutionary Computation, Honolulu, HI USA, 2002: 1671-1676.
[147] Kennedy J. Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. eds. Proceedings of IEEE Congress on Evolutionary Computation. Washington, USA, 1999: 1931-1938.
[148] Suganthan P N. Particle swarm optimizer with neighborhood operator. ed. Proceedings of the Congress on Evolutionary Computation. Washington, USA, 1999: 1958-1961.
[149] Parsopoulos K E, Vrahatis M N. A unified particle swarm optimization scheme. Lecture Notes in Computer Science, 2005, 3449: 590-599.
[150] Mendes R, Kennedy J, Neves J. The fully informed particle swarm: Simpler, may be better. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 84-89.
[151] Peram T, Veeramachaneni K, Mohan C K. Fitness-distance-ratio based particle swarm optimization. In: Proceedings of Swarm Intelligence Symposium. Indianapolis, 2003, 174-181.
[152] Angeline P J. Using selection to improve particle swarm optimization. In: Proceedings of IEEE World Congress on Computational Intelligence. Anchorage, AK, 1998, 84-89.
[153] Stacey A, Jancic M, Grundy I. Particle swarm optimization with mutation. In: Proceedings of the 2003 Congress on Evolutionary Computation. Canberra, 2003, 1425-1430.
[154] Higashi N, Iha H. Particle swarm optimization with gaussian mutation. In: Proceedings of the IEEE Swarm Intelligence Symposium (SIS 2003). Indianapolis, Indiana, 2003, 72-79
[155] Lovbjerg M, Rasmussen T K, Krink T. Hybrid particle swarm optimizer with breeding and subpopulation. In: Proceedings of the 3rd Genetic Evolutionary Computation. San Francisco, CA, 2001,469-476
[156] Van den Bergh F, Engelbrecht A P. A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation, 2004, 8(3): 225-239.
[157]Beasley D,Bull D,Martin R.A sequential niche technique for multimodal function optimization.Evolutionary Computation,1993,101-125.
[158]Parsopoulos K E,Plagianakos V P,Magoulas G D.Improving particle swarm optimizer by function "Stretching".Hadjisawas N,Pardalos P.Advances in Convex Analysis and Global Optimization.The Netherlands:Kluwer Academic Publishers,2001,445-457.
[159]Krink T,Vesterstrom J S,Riget J.Particle swarm optimisation with spatial particle extension.In:Proceedings of the 2002 Congress on Evolutionary Computation.Honolulu,HI USA,2002,1474-1479
[160]Xie X,Zhang W,Yang Z.A dissipative particle swarm optimization.In:Proceedings of the Congress on Evolutionary Computation.Honolulu,HI,2002,1456-1461
[161]Parsopoulos K E,Vrahatis M N.On the computation of all global minimizers through particle swarm optimization.IEEE Transactions on Evolutionary Computation,2004,8(3):211-224.
[162]Shi Y,Eberhart R.Empirical study of particle swarm optimization.International Conference on Evolutionary Computation.Washington,USA:IEEE,1999,1945-1950.
[163]Shi Y,Eberhart R.Fuzzy adaptive particle swarm optimization.The IEEE Congress on Evolutionary Computation.San Francisco,USA:IEEE,2001,101-106.
[164]Eberhart R,Shi Y.Tracking and optimizing dynamic systems with particle swarms.The IEEE Congress on Evolutionary Computation.San Francisco,USA:IEEE,2001,94-100.
[165]Chatterjeea A,Siarryb P.Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization.Computers & Operations Research,2006,33(3):859-871.
[166]Jiao B,Lian Z G,Gu X S.A dynamic inertia weight particle swarm optimization algorithm.Chaos,Solitons and Fractals,2005,25(5):1261-1271.
[167]Yang X M,Yuan J S,Mao H N.A modified particle swarm optimizer with dynamic adaptation.Applied Mathematics and Computation,2007,189(2):1205-1213.
[168]Liu B,Wang L,Jin Y H,Tang F et al.Improved particle swarm optimization combined with chaos.Chaos,Solitons and Fractals,2005,25(5) 1261-1271.
[169]陈贵敏,贾建援,韩琪.粒子群优化算法的惯性权值递减策略研究.西安交通大学学报,2006,40(1):53-56.
[170]Xueming Yang,Jinsha Yuan,Jiangye Yuan et al.A modified particle swarm optimizer with dynamic adaptation.Applied Mathematics and Computation,2007,189(2):1205-1213.
[171]张选平,杜玉平,秦国强等.一种动态改变惯性权的自适应粒子群算法.西安交通大学学报,2005,29(10):1039-1042.
[172]路克中,王汝传,帅小应.保持粒子活性的改进粒子群优化算法.计算机工程与应用,2007,43(11):25-38.
[173]Schirmer A.Case-based reasoning and improved adaptive search for project scheduling.Naval Research Logistics,2000,47(3):201-222.
[174]Klein R,Scholl A.Computing lower bounds by destructive improvement:An application to resource-constrained project scheduling.European Journal of Operational Research,1999,112(2):322-346.
[175]Vails V,Ballestin F,Quintanilla S.Justification technique generalizations.International Series in Operations Research & Management Science,2006,12:204-223.
[176]Bautista J,Pereira P.Ant colonies for the RCPS problem.Lectures on Computers Science,2002,2504:257-268.
[177]Liang Y C.An ant colony approach to resource-constrained project scheduling problems.Proceeding of the Fifth Asia-Pacific Industrial and Management System Conference,2004.
[178]Gambardella L M,Taillard E D,Dorigo M.Ant colonies for th.e quadratic assignment problem,Journal of the Operational Research Society,1999,50(2):167-176.
[179]Bruno P.数据结构与算法—面向对象的C++设计模式.北京:电子工业出版社,2003.
[180]Steward D V.The design structure system:A method for managing the design of complex system.IEEE Transactions on Engineering Management,1981,28(3):71-74.
[181]徐晓刚,刘伟,李明等.基于DSM的产品开发流程再造.机械设计与制造工程,2001,30(4):34-36.
[182]曹健,张友良,赵海燕.并行设计耦合任务集的识别方法.机械科学与技术,1999,18(2):336-338.
[183]梅成刚,肖人彬.复杂设计过程的信息建模及重组.机械科学与技术,2004,23(1):105-109.
[184]Zhuang M,Yassine A.Task Scheduling of Parallel development Projects using genetic algorithms.2004 American society of mechanical engineers design automation conference,Salt Lake City,Utah USA:ASME,2004.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |