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

中国管理科学 ›› 2007, Vol. 15 ›› Issue (5): 88-93.

• 论文 • 上一篇    下一篇

基于机动时间的可分解平行工序顺序优化研究

李星梅, 乞建勋, 牛东晓   

  1. 华北电力大学工商管理学院 北京102206
  • 收稿日期:2006-11-02 修回日期:2007-08-13 出版日期:2007-10-31 发布日期:2007-10-31
  • 作者简介:李星梅(1971- ),女(满族),河北省承德市人,华北电力大学在读博士研究生,研究方向:项目进度与计划管理.
  • 基金资助:

    国家自然科学基金资助项目(70671040);国家教育部博士学科点科研基金资助项目(20050079008)

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

PDF (PC)

877

被引次数

20

摘要： 平行工序的顺序优化是解决资源有限项目进度计划问题的最有效、最普遍的方法之一。对于该类问题的研究目前主要基于工序的不可分解性,而现实情况下有些工序是任意可分的。基于此,本文首先提出了最小路长定理,在其基础上,建立了任意可分的两个平行工序调整为顺序工序的亏值模型,并进行了理论证明,此外,针对从n个可分解平行工序中选取一个与指定工序调整为顺序工序的优化问题进行了研究,在已给亏值模型的基础上设计出了优化算法,越是大型网络,该方法的优越性越明显。

关键词: 项目管理, 工序排序优化, 机动时间, 可分解工序

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

中图分类号: