An exact algorithm for minimizing resource availability costs in project scheduling

作者：Rodrigues Savio B^*; Yamashita Denise S

来源：European Journal of Operational Research, 2010, 206(3): 562-568.

DOI：10.1016/j.ejor.2010.03.008

• Project scheduling
• Resource availability
• Exact algorithm

A new exact algorithm that solves the Resource Availability Cost Problem (RACP) in project scheduling is shown to yield a significant improvement over the existing algorithm in the literature. The new algorithm consists of a hybrid method where an initial feasible solution is found heuristically. The branching scheme solves a Resource-Constrained Project Scheduling Problem (RCPSP) at each node where the resources of the RACP are fixed. The knowledge of previously solved RCPSPs is used to produce cuts in the search tree. A worst-case-performance theorem is established for this new algorithm. Experiments are performed on instances adapted from the PSPLIB database. The new algorithm can be used to minimize any resource availability cost problem once a procedure for the underlying resource-constrained problem is available.

• 出版日期2010-11-1