A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost |
| |
Authors: | Frank P Buffa Joseph R Munn |
| |
Institution: | 1.College of Business Administration, Texas A & M University, College Station;2.Hankamer School of Business, Baylor University,Waco,USA |
| |
Abstract: | A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|