In this paper, we study the well-known resource availability cost problem with stochastic resource availability. The objective is to determine the initial levels of all renewable resources and establish a schedule corresponding to each scenario such that the expected resource availability cost is minimized. We assume that resource shortfalls can be compensated externally but at a noticeable higher cost. We formulate the problem as a two-stage stochastic programming model (TSSPM). We also develop an exact decomposition-based algorithm (DBA) for the particular case of the problem with at most two resources, which also functions as a heuristic for the original problem. Since the number of scenarios influences the performance of the developed solution approaches, we utilize a fast scenario reduction method to reduce the number of scenarios. Computational results indicate that the DBA outperforms the TSSPM formulation in solution quality and CPU runtime.

Keywords