Author

Qi YuanFollow

Date of Award

5-2013

Degree Type

Dissertation

Degree Name

Doctor of Philosophy

Major

Industrial Engineering

Major Professor

Xiaoyan Zhu

Committee Members

Xueping Li, Joseph Wilck, Frank M. Guess

Abstract

Resource allocation in supply chain management studies how to allocate the limited available resources economically/optimally to satisfy the demands. It is an important research area in operations research. This dissertation focuses on the modeling and optimization of three problems.

The first part of the dissertation investigates an important and unique problem in a supply chain distribution network, namely minimum cost network flow with variable lower bounds (MCNF-VLB). This type of network can be used to optimize the utilization of distribution channels (i.e., resources) in a large supply network, in order to minimize the total cost while satisfying flow conservation, lower and upper bounds, and demand/supply constraints. The second part of the dissertation introduces a novel method adopted from multi-product inventory control to optimally allocate the cache space and the frequency (i.e., resources) for multi-stream data prefetching in computer science. The objective is to minimize the cache miss level (backorder level), while satisfying the cache space (inventory space) and the total prefetching frequency (total order frequency) constraints. Also, efforts have also been made to extend the model for a multi-level, multi-stream prefetching system. The third part of the dissertation studies the joint capacity (i.e., resources) and demand allocation problem in a service delivery network. The objective is to minimize the total cost while satisfying a required service reliability, which measures the probability of satisfying customer demand within a delivery time interval.

Comments

This dissertation addresses three applications of resource allocation in supply chain management area.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Share

COinS