不确定环境下模具制造多项目动态调度建模与仿真
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
模具是工业生产中不可或缺的基础工艺装备,主要用于高效大批量生产工业产品中的有关零部件和制件,是制造装备业的重要组成部分。模具制造水平的高低,已经成为衡量一个国家产品制造水平高低的重要标志。伴随着全球制造业向我国转移的大趋势,广东逐渐成为世界制造业的重要基地之一,模具需求量日益增加。然而,与发达工业国家相比,我国模具工业的综合水平仍存在一定的差距,这种差距在企业生产管理方面表现得尤为明显。
     模具制造属于面向资源的单件工程订货型生产方式。模具生产过程特别强调交叉与并行,自始至终存在着双向信息的传递,属于典型的项目式运作模式。模具的生产管理具有多企业、多项目共享资源,协调管理的典型需求。模具生产过程中存在许多不确定因素(如任务工期不确定、可再生资源发生故障、随机插入新订单等),这些不确定因素的出现往往导致实际生产无法遵循开始制订的基准调度计划,只有采取行之有效的预防方法和科学的动态调度与控制策略,才能优化资源配置,尽量消除不确定因素的影响,确保项目顺利进行。
     本文在国家自然科学基金(50675039、50875051)和国家863计划资助项目(2006AA04Z132)的联合资助下研究不确定环境下的模具制造多项目动态调度问题。从模具制造的实际情况出发,分析了不确定因素的描述方法,并详细探讨了模具制造多项目动态调度的决策机制,以及相关调度模型的构建、仿真与求解方法。论文研究成果的应用,将有利于提高模具企业的生产管理水平,从而提升我国模具行业的整体竞争力。
     论文的主要工作包括如下几个方面:
     1、分析了模具的制造方式与特点,阐述了不确定因素和突发事件对模具制造多项目调度计划的影响,在此基础上构建了一种不确定环境下的模具制造多项目预测—反应式调度模型;
     2、针对模具制造项目执行过程中任务工期不确定的情况,提出了一种模具制造多项目预测—反应式调度模型求解算法。首先采用启发式微粒群算法,并结合基于关键链技术的时间缓冲设置方法求取模具制造多项目调度的预测计划(基准调度计划)。在调度计划执行过程中,以任务拖期为作为反应调度的触发事件,应用基于复合最优模型的改进微粒群算法,并结合修改后的串行调度生成方案和并行调度生产方案求解反应调度模型,以缓解局部任务拖期对整体调度计划的影响;
     3、针对模具制造项目执行过程中任务工期不确定和项目调度计划具有固定资源流约束的情况,提出了一种度量资源流网络稳定性的方法,并设计了一种基于优先规则的微粒群算法来构建稳定的资源流网络,在此基础上提出了一种具有固定资源流约束的模具制造多项目预测—反应式调度模型求解算法;
     4、针对可再生资源发生故障与任务工期不确定这两种不确定因素同时出现对多项目调度计划的干扰问题,提出了一种模具制造多项目预测—反应式调度模型求解算法。采用生灭过程理论对可再生资源的不确定性进行了分析与建模,提出了一种基于两阶段优化的启发式算法来求解稳定的基准调度计划。根据实际情况,对常用的串行调度生成方案进行了修改,在此基础上提出了一种基于混沌微粒群算法的反应调度算法;
     5、从多目标优化的角度出发,系统地研究了可随机插单、可再生资源发生故障以及任务工期不确定等多种不确定因素共同影响下的模具制造多项目动态调度问题。提出了一种基于最优解评估选取方法,并将孤立点搜索策略与精英归档策略相结合的改进多目标微粒群算法进行反应调度模型求解;
     6、开发了一套《不确定环境下的模具制造多项目动态调度仿真系统》,便于设置不同的环境,采用各种不同的算法和数据,以及配置不同的算法参数进行模具制造多项目调度仿真,从而对上述调度模型的合理性与有效性进行分析与验证,同时也有利于对相关调度算法的性能进行系统地分析与比较。
Moulds and Dies (M&D), mainly used for efficient mass production of industry product parts and components, are indispensably basic craft equipment for industrial production; they serve as an essential constituent for total equipment manufacturing industry. Simply put, the level of M&D manufacturing has become an important indicator for measuring a country's product manufacturing level. Accompanied by the trend that global manufacturing industry is transferring to China, Guangdong province has been gradually becoming one of most important manufacturing bases in the world with the ever-growing demand for M&D. As opposed to the average level of M&D industry of developed industrial countries, however, the level of M&D industry of our nation, especially that in the enterprise production management area, is still lagging behind.
     M&D manufacturing is generally in the single-project order form with resource-oriented feature. Regarded as a typical project-based operation model, the M&D production process places a very special emphasis on cross and parallelism; inside the process always exists the two-way information transmission between a project and another. M&D production management features typical requirements for resource pooling and management coordination by multiple enterprises and projects. In practical M&D production exist many uncertainties, such as task delaying, renewable resources breaking-down and new projects arriving at random time, making it always impossible for production managers to follow the original baseline schedule (or initial schedule). Only by taking effective preventive approaches and scientific dynamic scheduling and controlling strategies can make it possible to optimize the resource allocation, to eliminate the influence of uncertainties and to ensure the project execution.
     Supported by the National Natural Science Foundation of China (Grant No.50675039, 50875051) and the National High-Tech. R&D Program of China (Grant No.2006AA04Z132), our research was focused on uncertainty-based dynamic scheduling problem for multiple M&D manufacturing projects. From the practical M&D manufacturing situation, the description methods for uncertainty factors were herein analyzed. The following two issues have been discussed in detail as well, the decision-making mechanism of dynamic scheduling for multiple M&D manufacturing projects, and the construction, simulation and solution methods for the related scheduling models. Applications of the research achievements will be advantageous to increase production management levels of M&D corporations, and to improve M&D industry whole competitiveness of our country.
     The research mainly includes the following aspects.
     1. The manufacturing model of M&D and its characteristics were analyzed, and uncertainties and incidents impacting on multiple M&D manufacturing projects scheduling were elaborated. A predictive-reactive scheduling model for multiple M&D manufacturing projects under uncertainties was constructed.
     2. Corresponding to the fact that task delaying frequently happens in multiple M&D manufacturing projects process, an algorithm was proposed to solve the predictive-reactive scheduling model. A stable baseline schedule was constructed by setting time buffers based on critical chain technology, therefore, to eliminate the effect of task delaying as far as possible. According to the actual situation, the commonly used serial schedule generation scheme and parallel schedule generation scheme were modified. On this basis, an improved particle swarm optimization was proposed to solve the reactive scheduling model.
     3. The concepts of resource flow and resource flow network were introduced in this thesis. A method of measuring the stability of resource flow network was proposed. On this basis, a particle swarm optimization based on the priority rules was put forward to construct a stable resource flow network and to simplify the solving process of the resource flow network. Considering the frequent occurrence of tasks delaying during multiple M&D manufacturing projects execution, an algorithm was proposed to solve the predictive-reactive scheduling model with fixed resource flow constraint.
     4. Considering the influence of renewable resources breaking-down and task delaying on scheduling for multiple M&D manufacturing projects, an algorithm was presented to solve the predictive-reactive scheduling model. Uncertain availabilities of renewable resources were analyzed with the theory of birth-death process, and a heuristic algorithm based on two-staged optimization was proposed to solve the stable baseline schedule. According to the actual situation, the commonly used serial schedule generation scheme was further modified. On this basis, a reactive scheduling algorithm based on chaotic particle swarm optimization was proposed.
     5. From multi-objective optimization perspective, a multi-objective dynamic scheduling problem for multiple M&D manufacturing projects was systematically studied with considering the co-influence of such multiple uncertainties as random arrival of new projects, breaking-down of renewable resources and tasks delaying. An improved multi-objective particle swarm optimization algorithm was proposed to solve the reactive scheduling model; based on the assessment and selection method for optimal solution, the algorithm combines both the isolated points searching strategy and the elite archiving strategy.
     6. A system-simulation software of dynamic scheduling for multiple M&D manufacturing projects under uncertainties was developed, with which it is convenient to simulate the dynamic scheduling process by setting up different environments. Using different algorithms as well as a large variety of data, and configuring various parameters for related algorithms, the system simulation software can analyze and verify the rationality and the effectiveness of the scheduling models mentioned above; in the meantime, such software can be also of great value for systematically analyzing and comparing the performance of the related scheduling algorithms.
引文
[1]机械部科技司技术政策编辑组.机械工业共性制造技术政策要点说明(模具部分).机械工艺师,1994,(6):2-4.
    [2]中国模具工业协会.模具行业“十二五”发展规划[EB/OL].北京:2010(2010-11-10)[2011-02-15]. http://www.cdmia.com.cn/c020114867.html.
    [3]毛宁,何汉武,伍乃骥.基于并行工程的模具生产管理[J].中国机械工程,1999,1(5):492-495.
    [4]Yamamoto M, Nof S F. Scheduling/rescheduling in the manufacturing operating environment [J]. International Journal of Production Research, 1985,23(4): 705-722.
    [5]Mignon D J, Honkomp S J, Reklaitis G V. A framework for investigating schedule robustness under uncertainty[J]. Computers and Chemical Engineering,1995.19(1): 615-620.
    [6]Aytug H, Lawley M A, et al. Executing production schedules in the face of uncertainties:A review and some future directions[J]. European Journal of Operation Research,2005,161(1):86-110.
    [7]Balasubramanian J. Optimization models and algorithms for batch process scheduling under uncertainty[D]. Pittsburgh:Canregic Mellon University,2003.
    [8]Zimmermann H J. An application-oriented view of modeling uncertainty [J]. European Journal of Operational Research,2000,122(2):190-198.
    [9]Subrahmanyam S, Pekny J F, Reklaitis G V. Design of batch chemical plants under market uncertainty[J]. Industrial and Engineering Chemistry Research,1994, 33(11):2688-2701.
    [10]李祖奎,Marianthi Ierapetritou,薛美盛.过程工业不确定条件下的计划与调度优化[J].化工进展,2009,28(7):1101-1108.
    [11]Anna B T.Proactive management of uncertainty to improve scheduling robustness in process industries[D]. Barcelona: Universitat Politμecnica de Catalunya,2006.
    [12]Geary S, Childerhouse P, To will D.Uncertainty and the seamless supply chain[J].Supply Chain Management Review,2002, (6):52-60.
    [13]Miller R, Lessard D. Understanding and managing risks in large engineering projects [J]. International Journal of Project Management,2001,19(8):437-443.
    [14]Avraham S, Jonathan B, Shlomo G.汤勇力,李从东,胡欣悦编译.项目管理:过程、方法与效益[M].北京:清华大学出版社,2009.
    [15]吴波.车间生产调度性能评价理论及其应用[D].武汉:武汉理工大学,2008.
    [16]Li W, Hui C, Li P, et al. Refinery planning under uncertainty[J]. Industrial and Engineering Chemistry Research,2004,43(21):6742-6755.
    [17]Wendt M, Li P, Wozny G. Nonlinear chance-constrained process optimization under uncertainty [J]. Industrial and Engineering Chemistry Research,2002,41(15): 3621-3629.
    [18]BrAautigam J, Mehler-Bicher A, Esche C Uncertainty as a key value driver of real options[EB/OL]. Turku:2003(2003-09-25)[2010-12-26]. http://www.realoptions.org/papers2003/BraeutigamUncertainty.pdf.
    [19]Pistikopoulos, EN. Uncertainty in process design and operations[J]. Computers and Chemical Engineering,1995,19(1):553-563.
    [20]顾幸生.不确定性条件下的生产调度[J].华东理工大学报,2000,26(5):441-446.
    [21]徐震浩.基于免疫优化算法的不确定性间歇生产过程调度问题研究[D].上海:华东理工大学,2004.
    [22]Honkomp S J, Mockus L, Reklaitis G V. Robust scheduling with processing time uncertainty [J]. Computers and Chemical Engineering,1997,21(1):1055-1060.
    [23]Schmidt C W, Grossmann I E. A mixed integer programming model for stochastic scheduling in new product development[J].Computers and Chemical Engineering, 1996,2(1):1239-1244.
    [24]李明切,顾幸生.处理时间不确定情况下Jobshop司题鲁棒调度研究[J].浙江大学学报(自然科学版),1998,32(2)(增刊):711-719.
    [25]王玮,汪定伟,王晓琦.基于模糊交货期的单件制造业准时化生产计划[J].系统工程学报,1998,13(2):63-69.
    [26]王朝晖,甘文采,陈浩勋,等.具有模糊缓冲库存约束的化工批处理过程的调度[J].系统工程理论与实践,1998,18(7):52-68.
    [27]Balasubramanian J, Grossmann I E. Scheduling optimization under uncertainty-an alternative approach[J]. Computer Chemical Engineering,2003,27(4):469-490.
    [28]Wang J. A fuzzy robust scheduling approach for product development projects[J]. European Journal of Operational Research,2004,152(1):180-194.
    [29]Petrovic D, Duenas A. A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions[J]. Fuzzy Sets and Systems,2006,157(16): 2273-2285.
    [30]李明切.间歇生产过程鲁棒调度策略的研究[D].上海:华东理工大学,1998.
    [31]Daeho K, Moon I. Rescheduling algorithms in case of unit failure for batch process management [J]. Computers and Chemical Engineering,1997,21(1):1067-1072.
    [32]Balasubramanian J, Grossmann I E. Approximation to multistage stochastic optimization in multiperiod batch plant scheduling under demand uncertainty[J]. Industrial and Engineering Chemistry Research,2004,43(14): 3695-3713.
    [33]陈宇.不确定环境下的多Agent鲁棒性生产调度研究[D].广州:广东工业大学,2009.
    [34]Bidot J. A General Framework Integrating Techniques for Scheduling under Uncertainty[D]. Toulouse:Institute National Polytechnique Toulouse,2005.
    [35]Jenson M T . Robust and flexible scheduling with evolutionary computation[D]. Aarhus:University of Aarhus,2001.
    [36]Ishii N, Muraki M. A process-variability-based online scheduling system in multi-product batch process[J].Computers and Chemical Engineering,1996, 20(2):217-234.
    [37]Lia Z, Ierapetritou M. Process scheduling under uncertainty:review and challenges[J]. Computers and Chemical Engineering,2008,32(4-5):715-727.
    [38]Allet S . Handling flexibility in a "generalized job shop" with a fuzzy approach[J].European Journal of Operational Research,2003,147(2):312-333.
    [39]Kouvelis P, Yu G.Robust discrete optimization and its application[M] . Dordrecht: Kluwer Academic Publishers, 1997.
    [40]Leon V J, Wu S D, Storer R H.Robustness measures and robust scheduling for job shops in the presence of disruptions[J]. IIE Transactions,1994,26(5):32-43.
    [41]Wu S D, By eon E, Storer R H. A graph-theoretic decomposition of job shop scheduling problems to achieve scheduling robustness[J]. Operation Research,1999, 47(1):113-124.
    [42]Briand C, La H T, Erschler J. A robust approach for the single machine scheduling problem[J]. Journal of Scheduling,2007,10(3):209-221.
    [43]丁然,李歧强,孙同景.不确定处理时间批处理过程的鲁棒调度新策略[J].系统工程理论与实践,2006,26(4):78-84.
    [44]李建更.某些调度问题区间摄动鲁棒性的研究[J].自动化学报,2001:27(1):24-30.
    [45]Sorensen K. Tabu searching for robust solutions[C]. Proceedings of the 4th Metaheuristics International Conference. Porto:2001,707-712.
    [46]T'kindt V, Billaut J C. Multicriteria scheduling-Theory, Models and Algorithms[M]. Berlin:Springer,2006.
    [47]Hoogeveen H. Multicriteria scheduling[J]. European Journal of Operational Research,2005,167(3):592-623.
    [48]Sanlaville E. Ordonnancement sous conditions changeantes[D]. Clermont-Ferrand: Universit'e Blaise Pascal,2004.
    [49]Church L K, Uzsoy R. Analysis of periodic and event-driven rescheduling policies in dynamic shops[J]. International Journal of Computer Integrated Manufacturing, 1992,5(3):153-163.
    [50]Wu S D, Storer R H, Chang P C.One-machine rescheduling heuristic with efficiency and stability as criteria[J]. Computers and Operations Research,1993, 20(1):1-14.
    [51]Leus R, Herroelen W. Scheduling for stability in single-machine production systems [J]. Journal of Scheduling,2007,10(3):223-235.
    [52]Vonder S V, Demeulemeester E. The trade-off between stability and makespan in resource-constrained project scheduling[J] . International Journal of Production Research,2006,44(2):215-236.
    [53]Schwindt C.Resource allocation in project management[M].Berlin:Springer,2005.
    [54]Leus R.The generation of stable project plans[D]. Leuven: Katholieke Universiteit Leuven,2003.
    [55]Debels D, Vanhoucke M. Future research avenues for resource constrained project scheduling:Search space restriction or neighborhood search extension[R]. Ghent: Ghent University,2006.
    [56]Lambrechts O, Demeulemeester E, Herroelen W. Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities[R]. Leuven:Katholieke Universiteit Leuven,2006.
    [57]Policella N, Oddi A, Smith S, Cesta A. Generating robust partial order schedules[C]. Proceedings of the Tenth International Conference on the Principles and Practice of Constraint Programming. Toronto:2004:496-511.
    [58]Aloulou M, Portmann M.An efficient proactive reactive scheduling approach to hedge against shop floor disturbances[C].1st Multidisciplinary Conference on Scheduling:Theory and Applications (MISTA2003). Nottingham:2003:337-362.
    [59]Demeulemeester E, Herroelen W. A branch-and-bound procedure for the resource-constrained project scheduling problem[J]. Management Science,1992,38(12): 1803-1818.
    [60]Mingozzi A, Maniezzo A, Ricciardelli S, et al. An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation[J]. Management Science,1998,44(5):714-729.
    [61]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):271-288.
    [62]Brucker P, Knust S. A linear programming and constrained propagation-based lower bound for the RCPSP[J]. European Journal of Operational Research,2000,127(2): 355-362.
    [63]Hartmann S.A self-adapting genetic algorithm for the project scheduling under resource constraints[J]. Naval Research Logistics,2002,49(5):433-448.
    [64]王宏,林丹,李敏强.一种求解资源受限项目调度问题的自适应遗传算法[J].系统工程,2005,23(12):99-102.
    [65]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.
    [66]Valls V, Ballestyn F, Quintanilla S. Justification and RCPSP:A technique that pays[J]. European Journal of Operational Research,2005,165(2):375-386.
    [67]杨波,万仲平,尹德玉.资源约束项目排序问题的一种修正蚁群算法[J].工程数学学报,2007,24(3):437-445.
    [68]王巍,赵国杰.粒子群优化在资源受限工程调度问题中的应用[J].哈尔滨工业大学学报,2007,39(4):669-672.
    [69]Rina A, Tiwari M K, Mukherjee S K. Artificial immune system based approach for solving resource constraint project scheduling problem[J]. International Journal of Advanced manufacturing technology,2007,34(5-6):584-593.
    [70]Herroelen W, Leus R. Project Scheduling under Uncertainty:Survey and Research Potientials[J]. European Journal of Operation Research,2005,165(2):289-306.
    [71]Neumann K. Scheduling of projects with stochastic evolution structure[M]//Project Scheduling-Recent Models, Algorithms and Applications. Boston, Mass., USA: Kluwer Academic Publishers,1999:309-332.
    [72]Vieria G E, Herrmann J W, Lin E. Rescheduling Manufacturing Systems:A framework of strategies, policies and methods[J].Journal of Scheduling,2003,6(1): 39-62.
    [73]Kuster J, Jannach D. Approach to efficient resource-constrained project rescheduling [C]. Proceeding 3rd European Starting AI Research Symposium(STAIRS'06) at ECAI. The Netherlands:IOS Press Amsterdam,2006:208-219.
    [74]Huang G Q, Lau J S K, Mak K L, et al.Distributed supply-chain project rescheduling:Part Ⅱ-Distributed affected operations rescheduling algorithm[J]. International Journal of Production Research,2006,44(1):1-25.
    [75]Calhoun K M, Deckro R F, et al.Planning and Re-planning in Project and Production Planning[J]. Omega,2002,30(3):155-170.
    [76]Artigues C, Roubellat F . A Polynomial Activity Insertion Algorithm in a Multi-resource Schedule with Cumulative Constraints and Multiple Models[J].European Journal of Operation Research,2000,127(2):297-316.
    [77]程序,吴澄.粒子群优化算法求解多模式项目再调度问题[J].计算机集成制造系统,2009,15(1):97-101.
    [78]李丹,张宏国.资源约束下多项目再调度算法[J].信息技术,2007,31(4):16-18.
    [79]Vonder V, Ballestin F, Demeulemeester E, et al. Heuristic procedures for reactive project scheduling[J]. Computers and Industrial Engineering,2007,52(1):11-28.
    [80]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.
    [81]Deblaere F, Demeulemeester E, Herroelen W. Reactive scheduling in the multi-mode RCPSP[J]. Computers and Operations Research,2011,38(1):63-74.
    [82]Demeulemeester E, Herroelen W. Project Scheduling-A Research Handbook[W]. Boston:Kluwer Academic Publishers,2002.
    [83]Vails V, Laguna M, et al. Project Scheduling with Stochastic Activity Interruptions [M]//Project Scheduling-Recent Models, Algorithms and Applications. Boston, Mass., USA:Kluwer Academic Publishers,1999:309-332.
    [84]Gutjahr W J, Strauss C, et al. A Stochastic Branch-and-bound Approach to Activity Crashing in Project Management[J]. INFORMS Journal on Computing,2000, 12(2):125-135.
    [85]Golenko G D, Gonik A. A Heuristic for Network Project Scheduling with Random Activity Durations Depending on the Resource Allocation[J]. International Journal on Production Economics,1998.55(2):149-162.
    [86]Jaein C, Matthew J R, Jay H L.Dynamic programming in a heuristically confined state space:a stochastic resource-constrained project scheduling application[J]. Computers and Chemical Engineering,2004,28(6-7):1039-1058.
    [87]Jaein C.Algorithmic framework for improving heuristics in stochastic, stage-wise optimization problems[D]. Atlanta:Georgia Institute of Technology,2004.
    [88]Sand G, Engell S.Modeling and solving real-time scheduling problems by stochastic integer programming[J]. Computers and Chemical Engineering,2004,28(6-7): 1087-1103.
    [89]Wang J. A fuzzy robust scheduling approach for product development projects[J]. European Journal of Operation Research,2004,152(1):180-194.
    [90]Jergensen M, Shepperd M. A systematic review of software development cost estimation studies[J]. IEEE Transactions on Software Engineering,2007,33(1): 33-51.
    [91]Hapke M, Slowinski R. Fuzzy Set Approach to Multi-objective and Multi-mode Project Scheduling under Uncertainty[M]//Scheduling Under Fuzziness. Heidelberg: Physica-Verlag,2000,197-221.
    [92]Ke Hua, Liu Baodin. Fuzzy project scheduling problem and its hybrid intelligent algorithm[J]. Applied Mathematical Modelling,2010,34(2):301-308.
    [93]Kwan W K, Mitsuo G, Yamazakia G. Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling[J]. Applied Soft Computing,2003,2(3): 174-188.
    [94]Longa L D, Ohsatob A. Fuzzy critical chain method for project scheduling under resource constraints and uncertainty[J]. International Journal of Project Management,2008,26(6):688-698.
    [95]王平亚,宋吉荣,郭耀煌.基于模糊弧长的网络计划模型及其算法[J].西南交通大学学报,1998,33(5):605-609.
    [96]胡志根,肖焕雄,向超群.模糊网络计划及其工期实现的可能性研究[J].武汉水利电力大学学报,1999,32(5):6-9.
    [97]陈志强,张宏国.求解不确定资源约束下的模糊调度算法[J].信息技术,2008,32(3),91-93,96.
    [98]赵克勤,黄德才.基于a+bi+cj型联系数的网络计划方法初探[J].系统工程与电子技术[J],2000,22(2):29-31.
    [99]黄德才,赵克勤.用联系数描述和处理网络计划中的不确定性[J].系统工程学报,1999,14(2):112-117.
    [100]杨应玖,杨毅,杨念.论灰色网络计划技术[J].武汉水利电力大学学报,1998,31(3):94-99.
    [101]Tavares L V, Ferreira J A A, Coelho J S. On the Optimal Management of Project Risk[J]. European Journal of Operation Research,1998,107(2):451-469.
    [102]Herroelen W, Leus R. The Construction of Stable Project Baseline Schedules[J]. European Journal of Operation Research,2004,156(3):550-565.
    [103]Leus R, Herroelen W. Stability and Resource Allocation in Project Planning[J]. ⅡE Transactions,2004,36(7):667-682.
    [104]Deblaere F, Demeulemeester E, Herroelen W. Robust resource allocation decision in resource constrained project[J]. Decision Science,2007,38(1):5-37.
    [105]Artigues C, Roubellat F, Billaut J C Characterization of a Set Schedules in a Resource-constrained Multi-project Scheduling Problem with Multiple Modes[J]. International Journal of Industrial Engineering-Theory, Applications and Practice,1999,6(2):112-122.
    [106]Vonder S V, Demeulemeester E, Herroelen W. Proactive heuristic procedures for robust project scheduling:An experiments analysis[J]. European Journal of Operational Resource,2008,189(3):723-733.
    [107]Chtourou H, Haouari M. A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling[J]. Computers and Industrial Engineering, 2008,55(1):183-194.
    [108]张宏国,徐晓飞,战德臣.不确定资源约束下项目鲁棒性调度算法[J].计算机应用研究,2009,26(6):2079-2082,2089.
    [109]Lambrechts O, Demeulemeester E, Herroelen W. Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities[J]. Journal of scheduling,2008,11(2):121-136.
    [110]Neumann K, Steinhardt U. GERT networks and the time-oriented evaluation of projects[M]. New York:Springer-Verlag,1979.
    [111]Kurihara K, NishiuchiEfficient N.Monte Carlo simulation method of GERT-type network for project management[J]. Computers and Industrial Engineering,2002, 42(2-4):521-531.
    [112]Abdi R, Ghasemzadeha H R, Abdollahpour S, et al.Modeling and analysis of mechanization projects of wheat production by GERT networks[J]. Agricultural Sciences in China,2010,9(7):1078-1083.
    [113]PMI(Project Management Institute). A guide to the project management body of knowledge(PMBOK Guide)[M]. Pennsylvania: Project Management Institute, Inc. 2008.
    [114]Vonder S, Demeulemeester E, Herroelen W. A classification of predictive-reactive project scheduling procedures[J]. Journal of Scheduling,2007,10(3):195-207.
    [115]Herroelen W, Demeulemeester E, Reyck B D. A note on the paper "Resource-constrained project scheduling:Notation, classification, models and methods" by Brucker et al[J]. European Journal of Operational Research,2001, 128(3):679-688.
    [116]刘士新.项目优化调度理论与方法[M].北京:机械工业出版社,2007.
    [117]Vonder V D. Proactive-reactive procedures for robust project scheduling[D]. Leuven: Katholieke Universiteit Leuven,2006.
    [118]Rainer Kolisch. Serial and parallel resource-constrained project scheduling methods revisited:theory and computation[J]. European Journal of Operational Research, 1996,90(2):320-333.
    [119]Behzad A, Ghreza J, Mirbahador A, et al. A new approach for buffer sizing in critical chain scheduling[C]. IEEE International Conference on Industrial Engineering and Engineering Management. Singapore:IEEE,2007:1037-1041.
    [120]Li Kun, Chen Yunxiang. Apply critical chain in project scheduling and estimating buffer size based on fuzzy technique[C]. IEEE International Conference on Industrial Engineering and Engineering Management. Singapore:IEEE,2007:1068-1072.
    [121]Xie Xue-mei, Yang Guang, Lin Chuang. Software development projects IRSE buffer settings and simulation based on critical chain[J]. The Journal of China Universities of Posts and Telecommunications,2010,17(1):100-106.
    [122]马力,管在林,何敏,等.基于关键链的自适应缓冲设置方法研究[J].华中科技大学学报(自然科学版),2008,36(11):80-82.
    [123]褚春超.缓冲估计与关键链项目管理[J].计算机集成制造系统,2008,14(5):1029-1035.
    [124]寿涌毅.资源受限多项目调度的模型与算法[M].杭州:浙江大学出版社,2010.
    [125]马国丰,尤建新,杜学美.项目进度的制约因素管理[M].北京:清华大学出版社,2007.
    [126]Tormos P, Lova A. Tools for resource-constrained project scheduling and control: forward and backwards lack analysis[J]. Journal of the Operational Research Society,2001,52(7):779-788.
    [127]莫巨华.基于关键链的项目调度模型与算法[D].沈阳:东北大学,2005.
    [128]Goldrat E M. Critical chain[M]. Great Barrington, MA:The North River Press, 1997.
    [129]Zhang Hong, Li Xiaodong, Li Heng, et al. Particle swarm optimization-based schemes for resource-constrained project scheduling[J]. Automation in Construction, 2005,14(3):393-404.
    [130]杨维,李歧强.粒子群优化算法综述[J].中国工程科学,2004,6(5):87-94.
    [131]段晓东,王存睿,刘向东.粒子群算法及其应用[M].沈阳:辽宁大学出版社,2007.
    [132]单泪源,吴娟,吴亮红,等.基于改进粒子群算法的资源受限项目进度研究[J].计算机工程与应用,2007,43(15):26-28,104.
    [133]Vonder S, Demeulemeester E, Herroelen W, et al. The trade-off between stability and makespan in resource-constrained project scheduling[J]. International Journal of Production Research,2006,44(2):215-236.
    [134]Artigues C, Roubellat F. A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes[J]. European Journal of Operational Research,2000,127(2):294-316.
    [135]Leus R. The generation of stable project plans-complexity and exact algorithms[D]. Leuven:Katholieke Universiteit Leuven,2004.
    [136]Policella N, Oddi A, Smith S F, et al. Generating robust partial order schedules[C]. Proceedings of the Tenth International Conference on the Principles and Practice of Constraint Programming. Tornoto,2004, 496-511.
    [137]Policella N, Smith S F, Cesta A, et al. Generating robust schedules through temporal flexibility[C]. Proceedings of the 14th International Conference on Automated Planning & Scheduling. Whistler,2004:209-218.
    [138]Cesta A, Oddi A, Smith S F.Profile based algorithms to solve multiple capacitated metric scheduling problems[C].Proceedings of the 4thInternational Conference on Artificial Intelligence Planning Systems. Pittsburgh,1998,214-223.
    [139]Aloulou M A, Portmann M C. An efficient proactive reactive scheduling approach to hedge against shop floor disturbances[C]. Proceedings of the 1st Multidisciplinary Conference on Scheduling:Theory and Applications. Nottingham,2003,337-362.
    [140]Deblaere F, Demeulemeester E, Herroelen W, et al. Proactive resource allocation heuristics for robust project scheduling[R]. Leuven:Department of decision sciences and information management, Katholieke Universiteit Leuven,2006.
    [141]Wayne L运筹学概率模型应用范例与解法[M].李乃文,崔群法,林细财,等,译.4版.北京:清华大学出版社,2006.
    [142]Feller W. An introduction to probability theory and its applications[M]. New York: Wiley,1968.
    [143]高文,祝明发.基于生火过程的机群系统高可用性分析与设计[J].微电子学与计算机,2001:18(4):47-49.
    [144]严蔚敏,吴伟民.数据结构[M].北京:清华大学出版社,2006.
    [145]程志刚,张立庆,李小林,等.基于Tent映射的混沌混合粒子群优化算法[J].系统工程与电子技术,2007,29(1):103-106.
    [146]Holland J H. Adaptation in Natural and Artificial Systems[M]. Michigan:The University of Michigan Press,1975.
    [147]Coello C A C An updated survey of evolutionary multiobjective optimization techniques:state of the art and future trends[C]. Proceeding of the Congress on evolutionary Computation. Washington D C,1999:3-13.
    [148]Coello C, Salzzar M. MOPSO:a proposal for multiple objective particle swarm optimization[C] . Proceedings of 2002 Congress on Evolutionary Computation. Was-Hington, DC:IEEE,2002:1051-1056.
    [149]Parsopoules K E, Vrahatis M N. Particle swarm optimization method in multiobjetive problems[C]. Proceedings of the 2002 ACM symposium on Applied computing. New York:ACM Press,2002:603-607.
    [150]Ray T, Liew K M. A swarm metaphor for multiobjetive design optimization[J]. Engineering Optimization,2002,34(2):141-153.
    [151]张利彪,周春光,马铭,等.基于粒子群算法求解多目标优化问题[J].计算机 研究与发展,2004,41(7):1286-1291.
    [152]Mestaghim S, Teich J. Strategies for finding local guides in multi-objective particle swarm optimization(MOPSO)[C]. Proceedings of the IEEE Swarm Inteligence Symposium. Indianapolis:IEEE,2003:26-33.
    [153]Hu X, Eberhart R. Multiobjective optimization using dynamic neighborhod particle swarm optimization[C]. Proceedings of the IEEE Congress on Evolutionary Computation. Honolulu:IEEE,2002:1677-1681.
    [154]Pulido G T, Coelo Coelo C A. Using clustering techniques to improve the performance of a multi-objetive particle swarm optimizer[C]. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2004. Seattle, USA: Springer-Verlag,2004:225-237.
    [155]Li X. A nondominated sorting particle swarm optimizer for multiobjetive optimization[C]. Procedings of the Genetic and Evolutionary Computation Conference. Chicago, USA:Springer-Verlag,2003:37-48.
    [156]Li X D. Better spread and convergence:particle swarm multi-objetive optimization using the maximin fitness function[C]. Proceedings of the Genetic and Evolutionary Computation Conference 2004. Seattle, USA:Springer-Verlag,2004:117-128.
    [157]Xiao X, Dow E R, Eberhart R, et al. Hybrid self-organizing maps and particle swarm Optimization approach[J]. Concurrency and Computation:Practice and Experience, 2004,16(9):895-915.
    [158]Ourique C O. Biseaia J E C, Pinto J C.The use of particle swarm optimization for dynamical analysis in chemical processes[J].Computer and Chemical Engineering, 2002,269(12):1783-1793.
    [159]Costa J E F, Lage P I C, Biscaia J E C On the numerical solution and optimization of styrene polymerization in tubular reactors[J]. Computer and Chemical Engineering,2003,27(11):1591-1604.
    [160]Kannan S, Slochanal S M R, Suhbaraj P, et al.Application of particle swarm optimization technique and its variants to generation expansion planning problem[J]. Electric Power Systems Reseach,2004,70(3):203-210.
    [161]王云,张伏生,陈建斌,段光辉.电力系统多目标无功优化研究[J].西安交通 大学学报,2008,42(2):213-217.
    [162]叶彬,张鹏翔,赵波,等.多目标混合进化算法及其在经济调度中的应用[J].电力系统及其自动化学报,2007,19(2):66-72.
    [163]Gaing Z L. Particle swarm optimization to solving the economic dispatch considering the generator constraints[J]. IEEE Transactions on Power System,2003,18(3): 1187-1195.
    [164]Nenortaite J, Simutis R. Stocks'trading system based on the particle swarm optimization algorithm[J]. International Conference on Computational Seience 2004. Krakow, Poland:Springer-Verlag,2004:843-850.
    [165]Abido M A. Muhiobjective particle swarm optimization for environmental/economic dispatch problem[J]. Electric Power System Reaseareh,2009,79(7):1105-1113.
    [166]刘志东,陈华,邹永明,张华.粒子群算法求解油田措施多目标规划模型[J].石油天然气学报,2009,31(1):261-263.
    [167]丁艳,金伟其,周海丰.基于粒子群算法的多阀值图像分割方法[J].光学技术,2008,34(4):636-637.
    [168]牛轶峰,沈林成.基于IMOPSO算法的多目标多聚焦图像融合[J].电子学报,2006,34(9):1578-1583.
    [169]Caoris S, Donelli M, Lommi A, et al. Location and imaging of two-dimensional scatters by using a particle swarm algorithm[J]-Journal of Electromagnetic Waves and Applications,2004,18(4):481-494.
    [170]Yin P Y. A discrete particle swarm algorithm for optimal polygonal approximation of digital curves[J]. Journal of Visual Communication and Image Representation.2004, 15(2):241-260.
    [171]Kennedy J, Eherhart R C.A discrete binary version of the particle swarm algorithm[C]. Proceedings of the World Multieonference on Systemics, Cybernetics and Informatics. Orlando:IEEE,1997:4104-4108.
    [172]段晓东,王楠桶,王存睿等.一种基于粒子群算法的分类器设计[J].计算机工程,2005,31(20):107-109.
    [173]Engelbrecht A P, Ismail A.Training product unit neural networks[J].Stability and Control: Theory and Applications,1999,2(1-2):59-74.
    [174]Messerschmidt L, Engelbrecht A P. Learning to play games using a PSO-based competitive learning approach[J]. IEEE Transactions on Evolutionary Computation, 2004,8(3):280-288.
    [175]贾兆红,陈华平,孙耀晖.多目标粒子群优化算法在柔性车间调度中的应用[J].小型微型计算机系统,2008,29(5):885-889.
    [176]贾兆红,陈华平,孙耀晖.混合粒子群算法在柔性工作车间调度中的应用[J].系统仿真学报,2007,19(20):4743-4747.
    [177]曲红,吴娟.基于动态多目标粒子群优化算法的资源受限研发项目进度[J].系统工程,2007,25(9):98-102.
    [178]欧微,邹逢兴,高政,等.基于多目标粒子群算法的混合流水车间调度方法研究[J].计算机工程与科学,2009,31(8):52-56.
    [179]王丽萍,江波,邱飞岳.基于决策偏好的多目标粒子群算法及其应用[J].计算机集成制造系统,2010,16(1):140-148.
    [180]Veldhuizen D, Lamont G. Multi-objective evolutionary algorithms:analyzing the state-of-the-art[J]. IEEE Transactions on Evolutionary Computation,2000,18(2): 125-147.
    [181]赵志刚,李陶深,杨林峰.求多目标优化问题的粒子群优化算法[J].计算机工程与应用,2009,45(29):37-40.
    [182]陈黎飞,姜青山,王声瑞.基于层次划分的最佳聚类数确定方法[J].软件学报,2008,19(1):62-72.
    [183]Berkhin P.Survey of clustering data mining technique[R]. San Jose:Accrue Software,2002.
    [184]Woo K G, Lee J H, Kim M H, Lee Y J. FINDIT:A fast and intelligent subspace clustering algorithm using dimension voting[J]. Information and Software Technology,2004,46(4):255-271.
    [185]Foss A, Zaiane O R. A parameterless method for eficiently discovering clusters of arbitrary shape in large datasets[C].Proceedings of the 2002 IEEE International Conference on Data Mining.Los Alamitos:IEEE Computer Society Press,2002: 179-186.
    [186]Agrawal R, Gehrke J, Gunopulos D, Raghavan P.Automatic subspace clustering of high dimensional data[J]. Data Mining and Knowledge Discovery,2005,11(1): 5-33.
    [187]Zitzler E, Deb K, Thiele L. Comparison of multi-objective evolutionary algorithms: Empirical results[J]. Evolutionary Computation,2000,8(2):173-195.
    [188]周刘喜,张兴华,李纬.一种改进的多目标粒子群优化算法[J].计算机工程与应用,2009,45(33):38-41.
    [189]王辉,钱锋.基于拥挤度与变异的动态微粒群多目标优化算法[J].控制与决策,2008,23(11):1238-1242,1248.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700