A HEURISTIC ALGORITHM FOR RESOURCE LEVELING IN MULTI-PROJECT, MULTI-RESOURCE SCHEDULING
A HEURISTIC ALGORITHM FOR RESOURCE LEVELING IN MULTI-PROJECT, MULTI-RESOURCE SCHEDULING
复制标题
多项目、多资源调度中资源平衡的启发式算法
DOI：
10.1111/j.1540-5915.1975.tb01041.x
复制
发表时间：
1975
期刊：
影响因子：
--
通讯作者：
Charles J. Willie
中科院分区：
文献类型：
--
作者：
B. M. Woodworth;Charles J. Willie
传统的项目管理技术，如PERT和CPM，由于重要和现实的网络属性和管理方面的考虑，其实用性受到阻碍。在许多情况下，涉及多个项目和大量资源。在这种情况下，最令人关切的是减少每项所需资源的最大数量。本文提出的算法能够对具有多个资源的多个项目中的单个活动进行调度，并对所需的每种资源的总量进行均衡。该算法的基础是用于检查活动开始时间的各种组合的排序程序。每种组合的有效性的衡量标准是每一时间段内每种资源所需数量的平方和。
The utility of conventional project management techniques, such as PERT and CPM, is hampered by significant and realistic network attributes and managerial considerations. There are many situations which involve more than one project and numerous resources. Of major concern in such situations is the reduction of the maximum quantity of each required resource. The algorithm presented here is capable of scheduling the individual activities in multiple projects with multiple resources and leveling the overall quantity of each resource which is required. The basis of the algorithm is a sequencing procedure for examining various combinations of activity start times. The measure of effectiveness for each combination is the sum of the squares of the required quantity of each resource in each time period.