| Single-machine scheduling of two activities with slack： CPM to minimize the total tardiness |
| |
| 引用本文： | 李星梅,乞建勋.Single-machine scheduling of two activities with slack： CPM to minimize the total tardiness[J].哈尔滨工业大学学报(英文版),2007,14(1):97-100. |
| |
| 作者姓名： | 李星梅 乞建勋 |
| |
| 作者单位： | North China Electric Power University，North China Electric Power University Beijing 102206，China，Beijing 102206，China |
| |
| 基金项目： | 国家自然科学基金
,
高等学校博士学科点专项科研项目 |
| |
| 摘 要： | Recently K.Chris studied single-machine schedu-ling with time windows(STW)1].In project manage-ment,the CPM algorithm computes a time windowwhich defined by the early start and late finishes timesfor each activity.In fact,activity slack is attained bytim…
|
| 关 键 词： | 计算机 性能监控器 单机 程序 |
| 文章编号： | 1005-9113（2007）01-0097-04 |
| 收稿时间： | 2005-05-10 |
Single-machine scheduling of two activities with slack:CPM to minimize the total tardiness |
| |
| LI Xing-mei,QI Jian-xun.Single-machine scheduling of two activities with slack:CPM to minimize the total tardiness[J].Journal of Harbin Institute of Technology,2007,14(1):97-100. |
| |
| Authors: | LI Xing-mei QI Jian-xun |
| |
| Abstract: | 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. |
| |
| Keywords: | CPM Scheduling Single-machine Activity float |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
