期刊文献+

计划评审技术中的延误惩罚问题 被引量:2

The Tardiness Penalties in Program Evaluation and Review Technique Chart
下载PDF
导出
摘要 对计划评审技术中各项活动的延误对总工期和总费用的影响进行研究,提出在计划评审技术中对延误活动的惩罚不应该只由该活动延误时间的长短来决定,而应综合考虑各项活动在计划评审技术中的重要性、后继活动赶工限度和赶工成本等因素。在对计划评审技术中的有向网络图进行线性规划表示、确定关键活动和关键路线的基础上,针对各项活动的重要性,分别给出计划评审技术中关键活动和非关键活动单位延误时间惩罚的计算方法。 Influences of delay activities in PERT (Program Evaluation and Review Technique) Chart were discussed. The tardiness penalty of an activity was determined by its delay time and importance (the slack time and the cost of overtaking of successor activities). To create the liner programming model of PERT Chart and get critical activities and its critical path, an algorithm for calculating the tardiness penalty of each delay activity in PERT Chart was proposed.
作者 罗守成
出处 《上海第二工业大学学报》 2005年第5期28-32,共5页 Journal of Shanghai Polytechnic University
基金 上海市教委科研基金(No.04RE16)资助项目
关键词 计划评审技术 延误 惩罚 算法 PERT tardiness penalty algorithm
  • 相关文献

参考文献4

  • 1魏国华等编著..实用运筹学[M].上海:复旦大学出版社,1987:486.
  • 2唐国春等著..现代排序论[M].上海:上海科学普及出版社,2003:352.
  • 3罗守成,张峰,唐国春.单机排序问题的数学规划表示[J].应用数学与计算数学学报,2000,14(2):77-82. 被引量:9
  • 4丁以中,JenniferS.Shang主编..管理科学 运用Spreadsheet建模和求解[M].北京:清华大学出版社,2003:403.

二级参考文献6

  • 1[1]Goemans,M.X.and D.P.Williamson,.Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming.Journal of Association for Computing Machinery,42(1995),1115-1145. 被引量:1
  • 2[2]Goemans,M.X.,Semidefinite programming in combinatorial optimization,Mathematical Programming,79(1997),143-161. 被引量:1
  • 3[3]Hall,L.A.,A.S.Schulz,D.B.Shmoys and J.Wein,Scheduling to minimize average completion time:Off-line and on-line approximation algorithms,Mathematics of Operations Research,22(1997),513-544. 被引量:1
  • 4[4]Phillips,C.,C.Stein and J.Wein,Minimizing average completion time in the presence of release dates,Mathematical Programming,82(1998),199-223. 被引量:1
  • 5[5]Phillips,C.A.,A.S.Schulz,D.B.Shmoys,C.Stein and J.Wein,Improved bounds on relaxations of a parallel machine scheduling problem,Journal of Combinatorial Optimization,1(1998),413-426. 被引量:1
  • 6[6]Skutella,Martin,Semidefinite relaxations for parallel machine scheduling,Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science,November,1998,472-481. 被引量:1

共引文献8

同被引文献48

引证文献2

二级引证文献37

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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