Models and heuristics for a class of resource allocation problems in supply chain

Abstract

Resource Allocation involves the distribution and utilization 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 modeled and solved for allocation in single echelon Supply Chain single objective allocation and allocation with certainty of static input data single performance measure driven allocation disintegrated allocation and routing both in strategic and operational level Such models that consider the above assumptions constraints are nominal models and their solutions are denoted nominal solutions However in practice these assumptions are rarely if ever true which raises questions regarding the practicability and validity of the problems and solutions obtained under these assumptions The allocation problems focusing bi or multiple objectives dynamic allocation bases on dynamic input data and constraints multiple performance driven allocation and integrated allocation and routing context are complex combinatorial problems which demand high computational time and effort for deriving compromised near optimal optimal solutions