A Polynomial Time Algorithm for Economic Lot-Sizing Problem with Multi Suppliers and Single Retailer

摘要

The paper considers a generalized case of the classical economic lot-sizing problem that single retailer may order from multi suppliers. Each order cost is characterized by a different all-unit discount function. In order to minimize the ordering cost and holding cost, the retailer need to determine when the products are ordered and how many are ordered and from which suppliers products are ordered. This paper proposes a dynamic programming algorithm for solving the problem with polynomial complexity.