Title :
Achieving sharp deliveries in supply chains through variance pool allocation
Author :
Garg, Dinesh ; Narahari, Y. ; Viswanadham, N.
Author_Institution :
Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
Abstract :
In this paper, our objective is to come up with a sound methodology to design supply chains with outstanding delivery performance. As the first step towards this objective, we consider supply chains with a linear workflow, which we call pipelined supply chains. We define a new index of delivery performance called delivery sharpness which measures the precision as well as the accuracy with which products are delivered to the customers. The specific problem we solve is: given the delivery sharpness to be achieved, how can we allocate variability across individual stages of the supply chain in a cost-effective way. We call this the variance pool allocation (VPA) problem. In formulating and solving the VPA problem, we explore interesting relationships among process capability indices Cp, CPk, and CPm, and generalize the notion of Motorola six sigma performance. The VPA problem leads to a four step design methodology and the resulting optimization problem is solved using the method of Lagrange multipliers. We present an interesting example of a supply chain in the plastics industry and illustrate the different steps of our methodology
Keywords :
optimisation; stock control; Motorola six sigma performance; VPA problem; delivery performance index; delivery sharpness; linear workflow; pipelined supply chains; plastics industry; process capability indices; sharp deliveries; supply chain design; variability allocation; variance pool allocation; variance pool allocation problem; Automation; Computer science; Costs; Design methodology; Lagrangian functions; Optimization methods; Plastics industry; Production; Six sigma; Supply chains;
Conference_Titel :
Robotics and Automation, 2002. Proceedings. ICRA '02. IEEE International Conference on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7272-7
DOI :
10.1109/ROBOT.2002.1013582