|
Author(s): |
Shisen Lv, School of Business Administration, North China Electric Power University, Beijing, China
Jianxun Qi, School of Business Administration, North China Electric Power University, Beijing, China
Xiuhua Zhao, School of Business Administration, North China Electric Power University, Beijing, China |
|
Abstract: |
A scheduling and optimization problem is studied in which there are a specified activity and another two activities which are all selected from n>3 independent activities in the CPM network. We can also say the problem is how to adjust the three activities in parallel processes to have the least possible delay. First, we study the three Parallel activities with slack optimization problems, which according to the definition of loss value, which means the complete time postponed by the scheduling. Chains can be divided into three pools according to the relationship between the time parameters of different activities in the chain. Then we deduce the theorem of criterion chain, and this gives the proof of the correctness of the scope of selecting the optimal chain, in which the program with the minimum value is what we require. And effectiveness of this method is proved. Finally, the results derived after each substitution is composed to find the optimal plan-the one with the minimum loss value.
|