主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2007, Vol. 15 ›› Issue (5): 88-93.

Previous Articles     Next Articles

The Sequencing Optimal Decision with Divisible Activities

LI Xing-mei, QI Jian-xun, NIU Dong-xiao   

  1. Institute of Business Management, North China Electric Power University, Beijing 102206, China
  • Received:2006-11-02 Revised:2007-08-13 Online:2007-10-31 Published:2007-10-31

Abstract: The sequencing optimal decision of parallel activities is one of the most effective and familiar methods in the issue of resource-constrained schedule planning.Researches on this problem have focused on the indivisible activities mainly ever before.In fact,many activities can be decomposed into arbitrary portions.In this case,this paper proposed the minimum project duration theory and on the foundationes-tablished the tardiness model of sequencing the two divisible parallel activities,then gave the theoretic proof.Furthermore,the problem of sequencing an activity selected amongn divisible parallel activities with a designated acivity is also studied in this paper.Based on the tardiness model,the optimal method and theoretic proof are provided.Especially for a large scale network,the superiority becomes very distinct.

Key words: project management, sequencing optimal decision of activities, divisible activities, tardiness

CLC Number: