Minimizing Resource Availability Costs in Time-Limited Project Networks
研究在项目截止日期约束下，如何最小化可更新资源的可用性成本，提出了一种有效的最优算法并报告了广泛的计算实验。
We consider the problem of minimizing renewable resource availability costs in an activity-on-the-node project network subject to a project due date. Project activities have fixed durations and may require the use of multiple renewable resources in constant amounts throughout their duration. Various assumptions may be made about the type of precedence relations, ready times, due dates, and task interruptability. Given a discrete, non-decreasing cost function of the constant resource availability for every resource type, the objective is to determine the resource availability levels in order to minimize the sum of the availability costs over all resource types. An effective optimal algorithm is described and extensive computational experience is reported.