A warehouse selection problem based on random delivery times

Article type: Research Article

Authors: Roychowdhury, Soma^{; *}

Affiliations: University of California, Davis and Indian Institute of Social Welfare and Business Management, Calcutta

Correspondence: [*] Corresponding author. E-mail: roychowd@wald.ucdavis.edu, srcdb@yahoo.com.

Abstract: This paper presents an approach to selecting the best warehouse, from a number of warehouses that is expected to have the highest possibility to deliver the goods to a retailer under consideration within a specified time. The decision is made at the design phase of the supply chain on the basis of the data on delivery times collected from the warehouses using affordable resources. For determining the necessary sample sizes, available resource is allocated over the warehouses. Here the delivery times are assumed to be random. A method of finding the optimal solution has been developed and applied to different delivery time distributions. A nonparametric method has been adopted in case the delivery time distributions are unknown. Numerical examples are provided for illustrating the method. Simulations have been carried out to show the worthiness of the proposed method. A sensitivity analysis has been done to examine how the optimal allocation changes with the change in the parameter values of the underlying distributions.

Keywords: Lagrangian, minimax policy, optimal allocation, random delivery time

DOI: 10.3233/MAS-2011-0177

Journal: Model Assisted Statistics and Applications, vol. 6, no. 2, pp. 89-98, 2011