CAJ | 학술논문

针对资源受限项目调度问题,提出了一种面向多资源约束的关键链识别算法.该算法首先基于优先规则的资源受限并行调度算法生成调度结果,接着依据此结果将活动的资源约束转换为活动的时序约束,形成新的时序约束活动依赖矩阵,然后以此为基础结合传统向后调度算法计算在此时序约束下活动的总时差,最后根据总时差值来确定关键活动,并组成关键链.
침대자원수한항목조도문제,제출료일충면향다자원약속적관건련식별산법.해산법수선기우우선규칙적자원수한병행조도산법생성조도결과,접착의거차결과장활동적자원약속전환위활동적시서약속,형성신적시서약속활동의뢰구진,연후이차위기출결합전통향후조도산법계산재차시서약속하활동적총시차,최후근거총시차치래학정관건활동,병조성관건련.
In order to solve the resource-constrained project scheduling problem (RCPSP), a critical chain identifying algorithm under the multi-resource constraints is proposed. Firstly, the scheduling alternative is generated by using of priority rule-based parallel scheduling scheme, and according to the scheduling result the resource constraints of activities are transformed into precedence constraints so as to form the new activity dependency matrix (NADM). Then on the basis of NADM, the resource-constrained float of each activity is calculated with the traditional backward scheduling algorithm. Finally, the critical activities are determined in accordance with the value of resource-constrained float, and the critical chain is identified.