A New Approach to Achieving Sharp and Timely Deliveries in Supply Chain Networks

Garg, Dinesh and Narahari, Y and Viswanadham, N (2003) A New Approach to Achieving Sharp and Timely Deliveries in Supply Chain Networks. In: 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2003. (IROS 2003), 27-31 October, Las Vegas,Nevada, Vol.3, 2315 -2320.

Preview

PDF a_new.pdf Download (396kB)

Abstract

In this paper, we come up with an innovative approach through which variability reduction and synchronization can be realized in supply chains. The approach developed is founded on a connection between mechanical design tolerancing and supply chain lead time compression. We use two metrics for delivery performance, delivery sharpness and delivery probability, which measure the accuracy as well as the precision with which products are delivered to the customers. Then we solve the following specific problem: given the delivery sharpness and delivery probability to be achieved, how can variability be allocated across individual stages of the supply chain in a cost-effective way. We call this the variance pool allocation (VPA) problem and we suggest a systematic approach for solving the VPA problem. We show that a variety of important supply chain design problems, such as supply chain partner selection, can be posed as instances of the VPA problem. We formulate and solve the VPA problem for a plastics industry supply chain and demonstrate how the solution can be used to choose the best mix of supply chain partners.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	�©1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Supply chain management;Variability reduction;Process capability indices;Statistical tolerancing;Variance pool allocation (VPA)
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	22 Dec 2005
Last Modified:	19 Sep 2010 04:22
URI:	http://eprints.iisc.ac.in/id/eprint/4725

Actions (login required)

View Item