CAJ | 학술논문

对于经典的时间－费用权衡问题，工序之间只存在单一时间约束，可用CPM网络表示。但是对于工序之间存在多种时间约束的时间-费用权衡问题，包括最大和最小时间约束（称为广义优先关系，简称GPRs），则只能用GPRs网络表示，比CPM网络复杂许多。首先，论述了带有GPRs的时间-费用权衡问题与经典问题的巨大差别：在GPRs中，（1）缩短某些关键工序的工期能使总工期缩短，但缩短另一些关键工序的工期反而能使总工期延长；（2）缩短或延长工序的工期可能会破坏项目自身的可行性；等。其次，研究了GPRs网络的特性，推导出该网络的路长定理。第三，根据该定理，设计出等效化简带有GPRs的大型时间-费用权衡问题的简单方法，从而大幅减小求解该问题的难度和计算量。最后，通过算例演示了该方法。
대우경전적시간－비용권형문제，공서지간지존재단일시간약속，가용CPM망락표시。단시대우공서지간존재다충시간약속적시간-비용권형문제，포괄최대화최소시간약속（칭위엄의우선관계，간칭GPRs），칙지능용GPRs망락표시，비CPM망락복잡허다。수선，논술료대유GPRs적시간-비용권형문제여경전문제적거대차별：재GPRs중，（1）축단모사관건공서적공기능사총공기축단，단축단령일사관건공서적공기반이능사총공기연장；（2）축단혹연장공서적공기가능회파배항목자신적가행성；등。기차，연구료GPRs망락적특성，추도출해망락적로장정리。제삼，근거해정리，설계출등효화간대유GPRs적대형시간-비용권형문제적간단방법，종이대폭감소구해해문제적난도화계산량。최후，통과산례연시료해방법。
For classic time-cost tradeoff problem, only single time constraint exists between activities, and it could be represented by CPM network.But for time-cost tradeoff problem when multiple time constraints exist between activities, which mainly contain maximal and minimal time constraints and are named as generalized precedence relations(GPRs), it only could be represented by GPRs network which is more complicated than CPM network.Firstly, huge differences between the time-cost tradeoff problem with GPRs and the classic prob-lem are analyzed:under GPRs, (1) compressing durations of some critical activities could compress total dura-tion, but compressing durations of some other ones could prolong the total duration;( 2 ) compressing or prolon-ging duration of activity may damage feasibility of project etc.Secondly, property of GPRs network is studied, and path length theorem of the network is deduced.Thirdly, according to the theorem, simple algorithm to sim-plify large scale time-cost tradeoff problem with GPRs is designed for decreasing difficulty and computation great-ly of solving the problem.And finally, the algorithm is illustrated by example.