期刊文献+

基于资源共享的延迟惩罚最小化的多项目调度优化 被引量:3

Scheduling Optimization of Multi-projects Overdue Penalty Minimization Based on Resource Sharing
原文传递
导出
摘要 对可并行进行的多项目调度问题进行定性描述,在共享资源的数量约束下,构建了以多项目延迟惩罚总和为目标函数的优化模型。鉴于问题的强NP-hard属性,为模型设计了迭代循环求解的启发式遗传算法。运用实际案例对研究进行验证,分析关键参数对合同双方项目收益的影响,得到如下结论:与实际进度安排相比,满意进度安排下承包商因延期完工而遭到来自于业主的罚款数额出现了明显的下降;业主的单位延迟罚款费用、共享资源池中的资源数量也会影响承包商对项目的进度安排,并对双方的项目收益产生重要影响。 This paper carries on the qualitative description based on the parallel multi-project scheduling problem.Under the shared-resource constraint conditions,this paper constructs the objective function of the minimization of overdue penalty of multi-projects.Because of the strong NP-hard attribute owned by the model,the authors develop a genetic heuristic algorithm to solve the problem and obtain the satisfied results.A practical example is solved by the heuristic and the influences of the key parameters on the project RCMPSP are analyzed.Based on the results obtained,the following conclusions are drawn:Compared with results under the actual situation, the overdue penalty under the optimal schedule from the client obviously decreased.The overdue penalty cost from the client and the resource quantity from pool influence the project profits remarkably.
出处 《工业工程与管理》 CSSCI 北大核心 2015年第6期69-75,共7页 Industrial Engineering and Management
基金 国家自然科学基金资助项目(71371150) 世纪优秀人才支持计划资助(NCET-13-0460)
关键词 RCMPSP 项目调度 延迟惩罚 资源共享约束 优化模型 遗传算法 RCMPSP project scheduling minimization of overdue penalty resource-constrained capacity optimization model genetic algorithms
  • 相关文献

参考文献12

二级参考文献108

共引文献107

同被引文献25

  • 1Swarc W. Optimal elimination methods in the m X n flow-shop scheduling problem [J]. Operations Research, 1973, 21 ( 6 ) . 1250-1259.
  • 2越民义,韩继业.同顺序m×n排序问题的一个新方法[J].科学通报,1979,24(18):821-824.
  • 3Carlier J,Rebai I. Two branch and bound algorithms for the permutation flow-shop problem E J 1. European Journal of Operational Research, 1996,90(1) : 238-251.
  • 4Garey M R, Johnson D S, Sethi R. The complexity of flow-shop and job-shop scheduling [J 1. Mathematics of Operations Research, 1976,1 (2) : 117-129.
  • 5Ahmadizar F. A new ant colony algorithm for make-span minimization in permutation flow shops [J]. Computers I Industrial Engineering, 2012(63( : 355-361.
  • 6Li X, Yin M. A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem [-J. Scientia Iranica Transactions E: Industrial Engineering 2012 (19) : 1921-1935.
  • 7Li Z, Huang G Q, Luo H. Hybrid flow shop assembly scheduling for oneoga-kind productionEC. In: Proceedings of International Conference on Computers and Industrial Engineering Hong Kong: Curran Associates Inc, 2013 : 784-803.
  • 8Pan Q K,Wang L,Gao L. A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers[J]. Applied Soft Computing 2011 (11) . 5270-5280.
  • 9LiX, Yin M. An oppositiowbased differential evolution algorithm for permutation flow shop scheduling based oil diversity measure[J]. Advances in Engineering Software 2013 (55) . 10-31.
  • 10Xie Z P, Zhang Z Y, Shao X Y, et al. An effective hybrid teaching-learning-based optimization algorithm for permutation flow shop scheduling problem[J]. Advances in Engineering Software 2014(77) : 35-47.

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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