期刊文献+

考虑资源置信度的跨企业项目鲁棒性调度算法 被引量:3

Resource-confidence-considered Robust Project Scheduling Algorithm for Cross-enterprise Project
下载PDF
导出
摘要 资源不确定性高和调度鲁棒性要求高是跨企业项目调度问题的重要特征,本文采用资源置信度度量资源的不确定性,建立了考虑资源置信度约束的跨企业项目鲁棒性优化调度模型,设计了路径重连求解算法.算法以路径重连机制搜索解空间,以嵌入的启发式时间缓冲插入算法快速生成鲁棒性调度,并可通过局部增强搜索算法进一步优化调度的鲁棒性.本文应用项目调度标准问题库PSPLIB中大量问题实例进行了仿真实验,同两个当前具有代表性的鲁棒性项目调度算法进行了比较,实验结果表明了文中算法的有效性与优势. Higher resources uncertainty and requirement of schedule robustness are key characteristics of cross-enterprise project scheduling. For this problem, some conceptions of re- source confidence are defined to measure the resource uncer- tainty, and a robustness optimization model for cross-enterprise project scheduling is developed which considers the special con- straint of resource confidence. A path relinking based project scheduling approach is presented. Firstly, the approach searches the solution space employing path relinking technique. Then, it embeds a heuristic time buffer insertion algorithm to quickly generate robust project schedule. If needed, a local enhanced search algorithm can be used to further improve the schedule robustness. The proposed approach has been tested on the stan- dard instances in PSPLIB, and compared with two well-known competitive algorithms. Experimental results have shown that the new proposed approach is highly effective and efficient for cross-enterprise project scheduling.
出处 《自动化学报》 EI CSCD 北大核心 2013年第12期2176-2185,共10页 Acta Automatica Sinica
基金 国家高技术研究发展计划(863计划)(2012AA040902,2012AA040904) 国家自然科学基金(71171066) 欧盟第七框架项目(295130)资助~~
关键词 跨企业项目 项目鲁棒性调度 资源置信度 路径重连算法 Cross-enterprise project, robust project schedul-ing, resource confidence, path relinking algorithm
  • 相关文献

参考文献3

二级参考文献95

  • 1罗家祥,唐立新.带释放时间的并行机调度问题的ILS & SS算法[J].自动化学报,2005,31(6):917-924. 被引量:8
  • 2翁克瑞,杨超,屈波.多分配枢纽站集覆盖问题及分散搜索算法实现[J].系统工程,2006,24(11):1-5. 被引量:1
  • 3Campos V, Laguna M, Marti R. Context-Independent Scatter Search and Tabu Search for Permutation Problems [J]. Informs Journal on Computing (S0899-1499), 2005, 17(1): 111-122.
  • 4Corberan A, Fermadez E, Laguna M, Marti R. Heuristic Solutions to the Problem of Routing School Buses with Multiple Objectives [J]. Journal of the Operational Research Society (S0160-5682), 2002, 53(4): 427-.435.
  • 5Marti R. Scatter Search-Wellsprings and Challenges [J]. European Journal of Operational Research (S0377-2217), 2006, 169(2): 351-358.
  • 6Gu M, He F, Song XY. Multiterminal net assignments by scatter search [J]. Mathematical and Computer Modelling (S0895-7177), 2005, 41(8-9): 997-1004.
  • 7Kelly J, Rangaswamy B, Xu J. A Scatter Search-Based Learning Algorithm for Neural Network Training [J]. Journal of Heuristics (S1381-1231), 1996, 2(2), 129-146.
  • 8Glover F. Heuristics for integer programming using surrogate constraints [J]. Decision Sciences (S0011-7315), 1977, 8, 156-166.
  • 9Glover F. A Template for Scatter Search and Path Relinking [C]// Hao, J K, Lutton E, Ronald E, Schoenauer M, Snyers D. (Eds.). Artificial Evolution, Lecture Notes in Computer Science (J0302-9743), 1998, 1363. Germany: Springer, 1998: 13-54.
  • 10Laguna M, Marti R. Scatter Search. Methodology and Implementations in C (S1577-5097) [M]. The Netherlands: Kluwer Academic Publishers, 2003.

共引文献132

同被引文献27

  • 1方炜,欧立雄.多项目环境下新产品研发项目资源分配问题研究[J].管理工程学报,2005,19(B10):6-10. 被引量:13
  • 2周炳海,蒋舒宇,王世进,吴斌,奚立峰.集成生产与预防性维护的流水线车间调度算法[J].大连海事大学学报,2007,33(3):32-35. 被引量:15
  • 3Al-Fawzana M A,Mohamed Haouarib.A bi-objective model for robust resource-constrained project scheduling[J].International Journal of Production Economics,2005,96 (2):175-187.
  • 4Babak Abbasia,Shahram Shadrokha,Jamal Arkatb.Bi-objective resource-constrained project scheduling with robustness and makespan criteria[J].Applied Mathematics and Computation,2006,180 (1):146-152.
  • 5JIAO Bin,LIAN Zhigang,GU Xingsheng.A dynamic inertia weight particle swarm optimization algorithm[J].Chaos,Solitons and Fractals,2008,37 (3):698-705.
  • 6殷瑞钰.关于钢铁制造流程的研究[J].金属学报,2007,43(11):1121-1128. 被引量:32
  • 7Safari E, Sadjadi S. A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown. Expert Systems with Applications, 2011, 38(3): 2020-2029.
  • 8Lee C Y. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 1997, 20(3): 129-139.
  • 9Vahedi-Nouri B, Fattahi P, Ramezanian R. Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems 2013, 32(1): 167-173.
  • 10Ramezanian R, Saidi-Mehrabad M, Fattahi P. MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints. Journal of Manufacturing Systems 2013, 32(2): 392-401.

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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