一种求解工程调度中多资源配置问题的启发式算法  

Heuristic algorithm for multi-resource investment problem in project scheduling

作　　者：王解法[1] 李世敬[1] 冯祖仁[1] 

机构地区：[1]西安交通大学系统工程研究所,西安710049

出　　处：《微电子学与计算机》2003年第9期39-42,45,共5页Microelectronics & Computer

摘　　要：针对工程调度中的多资源配置问题,设计了一种启发式算法,该算法以指定的工程最大持续时间和指定的资源均衡轮廓为约束,以购买资源的成本最小为目标。算法不断重复以下两部分直到工程的最大持续时间达到要求:求解资源受限的工程调度问题,来评价当前的资源配置并确定瓶颈资源;增加瓶颈资源来修改当前的资源配置。算法中的瓶颈资源就是指关键线路上“等待时间/购买价格之和”最大的作业所缺的资源。We proposed a heuristic algorithm for resource leveling problem in project scheduling.The objective is minimizing costs of resource investments subjective to the prescribed maximum project duration and resource profiles.The heuristic algorithm includes two steps:solving resource -constrained project scheduling problem to evaluate the current resource leveling,and modifying the current resource numbers by adding certain bottleneck resources.The algorithm iterates until the project duration reaches the due time.The bottleneck resources are referred to the lack resources used by the item in critical path that has the maximum ratio of wait time to their lack resources prices.

关 键 词：工程调度 资源配置问题 启发式算法 数学模型 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]