Single-machine scheduling of two activities with slack: CPM to minimize the total tardiness  

作　　者：李星梅 乞建勋 

机构地区：[1]North China Electric Power University

出　　处：《Journal of Harbin Institute of Technology(New Series)》2007年第1期97-100,共4页哈尔滨工业大学学报（英文版）

基　　金：Sponsored by the National Natural Science Foundation of China(Grant No.70671040)and Specialized Research Fund for the Doctoral Program of High Education(Grant No.20050079008).

摘　　要：In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.In a CPM network, the longest path problem is one of the most important subjects. According to the intrinsic principle of CPM network, the length of the paths between arbitrary two nodes is presented. Furthermore, the length of the longest path from start node to arbitrary node and from arbitrary node to end node is proposed. In view of a scheduling problem of two activities with float in the CPM scheduling, we put forward Barycenter Theory and prove this theory based on the algorithm of the length of the longest path. By this theory, we know which activity should be done firstly. At last, we show our theory by an example.

关 键 词：CPM SCHEDULING SINGLE-MACHINE Activity float 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]