SIA OpenIR  > 工业信息学研究室  > 先进制造技术研究室
 Models and Algorithms for Capacitated Lot Sizing Problems Alternative Title 石化企业能力批量问题的模型与算法研究 Liu X(刘晓)1,2 Department 先进制造技术研究室 Thesis Advisor 王成恩 ; 储诚斌 Classification F27 Keyword Production/procurement Planning Lot Sizing Single Item Inventory Dynamic Programming Algorithm Call Number F27/L75/2005 Pages 176页 Degree Discipline 机械电子工程 Degree Name 博士 2004-12-20 Degree Grantor 中国科学院沈阳自动化研究所 Place of Conferral 沈阳 Abstract This thesis develops and investigates exact approaches to classical and practical capacitated lot sizing problems in petrochemical industries. The refinery provides a host of very challenging problems in production/procurement planning. Two typical production/procurement planning problems are investigated, which are single item capacitated lot sizing problems oriented refineries, and multi-item procurement planning problems in distributed supply chain with multi-suppliers, multi-refineries and multi-customs. Due to the characters in petrochemical products, the total demands are always more than production capacities. On the other side, even the total demands are less than production capacities, since the rule of meeting demands may lead to excessive inventory holding costs in some periods, it is cheaper to permit lost sales in order to get maximum profit. Furthermore, by analyzing the practical production/procurement planning on special cases in a refinery, the production capacity is high enough, but the reorder quantities are restricted by inventory capacity instead of production capacity. A single item dynamic lot size model with inventory capacity and lost sales is formulated. Subsequently, we extend a single item inventory capacity economic lot sizing model with lost sales to more general cost functions, which are concave functions. Stockout and conservation models are considered as well. Zero Inventory Order property cannot be used anymore here. Two strongly polynomial algorithms are developed based on some new properties, respectively. Some theoretical analyses for algorithms are performed. The computational results show that proposed approaches could get a satisfactory solution and has potential to practical production applications. Finally, by analyzing the crude oil procurement planning for distributed supply chain with multi-suppliers and multi-refineries, a purchasing problem originating from the purchase center as buyer’s point of view is described. The refineries outsource their crude oil procurement to purchase center for scale economies. A multi-objective procurement planning model is established, which not only minimizes supply chain cycle time, the total costs of earliness and tardiness penalties, production costs and transportation costs, but also considers quality and delivery on time. Through model transformation, the objective function can be solved by the general mathematical programming methods. The numerical computations demonstrates that the approach proposed is efficient and applicable, which can not only make effective procurement planning, minimize the cycle time of the supply chain，but also can choose the suppliers reasonably and optimize the configuration of resources. Language 英语 Contribution Rank 1 Document Type 学位论文 Identifier http://ir.sia.cn/handle/173321/9538 Collection 工业信息学研究室_先进制造技术研究室 Affiliation 1.中国科学院沈阳自动化研究所2.中国科学院研究生院 Recommended CitationGB/T 7714 Liu X. Models and Algorithms for Capacitated Lot Sizing Problems[D]. 沈阳. 中国科学院沈阳自动化研究所,2004.
 Files in This Item: File Name/Size DocType Version Access License Models and Algorithm（679KB） 学位论文 开放获取 CC BY-NC-SA Application Full Text
 Related Services Recommend this item Bookmark Usage statistics Export to Endnote Google Scholar Similar articles in Google Scholar [Liu X(刘晓)]'s Articles Baidu academic Similar articles in Baidu academic [Liu X(刘晓)]'s Articles Bing Scholar Similar articles in Bing Scholar [Liu X(刘晓)]'s Articles Terms of Use No data! Social Bookmark/Share