多项目调度问题研究  

Research on multi-project scheduling problem

作　　者：宗砚[1] 王文玺[1] 林魁[1] 

机构地区：[1]华中科技大学机械科学与工程学院数字制造装备与技术国家重点实验室,湖北武汉430074

出　　处：《机械》2010年第9期45-48,共4页Machinery

基　　金：国家863资助项目(2007AA04Z190;2009AA043301)

摘　　要：现有多项目调度研究一般都基于不切实际的假定——资源在多个项目间进行传递时不需要花费额外的时间和成本。在对传递时间进行分析的基础上,建立了考虑资源传递时间的多项目调度问题的数学模型,并针对模型设计了结合并行调度的混合遗传算法,在保证项目任务紧前关系与资源约束的条件下,能够合理优化多项目的资源分配,从而有效地缩短多项目的总工期,通过实例验证了考虑传递时间的必要性,同时实例也证明了算法的有效性。Most approaches proposed in the literature so far are based on the unrealistic assumption that resources can be transferred from one project to the other without any expense in time or cost,so we generalize the multi-project scheduling problem by addition-ally including sequence-and resource-dependent transfer times.In this paper,we define the modified resource constrained multi-project scheduling problem with transfer times and a new hybrid genetic algorithm with parallel scheduling was proposed to solve the problem.The algorithm can optimize the resource allocation among project activities without violating precedence relations and resource constraints,and can compress the project schedules and shorten the overall project durations.Its application in real projects and comparison with other scheduling schemes confirmed that the algorithm is effective to the modified problem and the mathematical model is valuable for multi-project scheduling.

关 键 词：传递时间 项目调度 资源约束 遗传算法 

分 类 号：F273[经济管理—企业管理]