Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem

Abstract

The resource allocation problem (RAP) determines a solution to optimally allocate limited resources to several activities or tasks. In this study, we propose a novel resource allocation problem referred to as multi -period non-shareable resource allocation problem (MNRAP), which is motivated by the characteristics of resources considered in the stem cell culture process for producing stem cell therapeutics. A resource considered in the MNRAP has the following three characteristics: (i) resource consumption required to perform an activity and available resource capacity may change over time; (ii) multiple activities cannot share one resource; and (iii) resource requirements can be satisfied through the combination of different types of resources. The MNRAP selects some of the given activities to maximize the overall profit under limited resources with these characteristics. To address this problem, pattern -based integer programming formulations based on the concept of resource patterns are proposed. These formulations attempt to overcome the limitations of a compact integer programming formulation, the utilization of which is challenging for large-scale problems owing to their complexity. Further, based on a branch -and -price approach to solving pattern -based formulations, effective heuristic algorithms are proposed to provide high -quality solutions for large instances. Moreover, through computational experiments on a wide range of instances, including real -world instances, the superiority of the proposed formulations and heuristic algorithms is demonstrated.