Class of resource allocation problems in supply chain - a review

Resource allocation (RA) involves the distribution and utilisation of available resources in the system. Because resource availability is usually scarce and expensive, it becomes important to find optimal solutions to such problems. Thus, RA problems represent an important class of problems faced by mathematical programmers. Conventionally, such RA problems have been modelled and solved for allocation in single echelon supply chain (SC), single objective allocation, allocation with certainty of static input data, single performance measure driven allocation, disintegrated allocation and routing both in strategic and operational level. This research focuses on detailed review of six new and complex sub-classes of RA problems in SC network focusing bi-objectives, dynamic input data, and multiple performance measures based allocation and integrated allocation and routing with complex constraints. This study considers six set of variants of the RA problems normally encountered in practice but has not been given attention to hitherto. These variants of the classical RA are complex and pertaining to both manufacturing and service industry. These variants have some applications that are of special interest, including those that arise in the areas of warehousing, transportation, logistics, and distribution. These application domains have important economic value, and high importance is attached to achieve efficient solutions.