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.

关键词： all-unit discount economic Lot size computational complexity inventory

作者: Qingguo Bai Hongge Zhao Chuanwei Wang

作者单位: School of Operations Research and Management Sciences, Qufu Normal University Rizhao,, Shandong, Chi Shandong Water Polytechnic College, Rizhao Shandong, China, 276800 College of Information Sciences and Engineering, Shandong Agricultural University, Taian, Shandong,

会议类型: 国际会议

会议名称: 中国数学会生物数学分会第六届学术年会

会议地点: 山东泰安

会议语种:英文

页码: 416-420

在线出版日期: 2008-07-25（万方平台首次上网日期，不代表论文的发表时间）