Resource Allocation (RA) 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. This book focuses on development of models and heuristics for six new and complex sub-classes of RA problems in Supply Chain (SC) networks, focusing on bi-objectives, dynamic input data, and multiple performance measures based allocation and integrated allocation, and routing with complex constraints. It considers six set of variants of the RA problems normally encountered in practice but have not yet been studied. These variants of the classical RA are complex and pertaining to both manufacturing and service industry.