中国科学院沈阳自动化研究所机构知识库
Advanced  
SIA OpenIR  > 工业信息学研究室  > 先进制造技术研究室  > 学位论文
题名: Models and Algorithms for Capacitated Lot Sizing Problems
其他题名: 石化企业能力批量问题的模型与算法研究
作者: Liu X(刘晓)
导师: 王成恩 ; 储诚斌
分类号: F27
关键词: production/procurement planning ; lot sizing ; single item ; inventory ; dynamic programming algorithm
索取号: F27/L75/2005
学位专业: 机械电子工程
学位类别: 博士
答辩日期: 2004-12-20
授予单位: 中国科学院沈阳自动化研究所
学位授予地点: 中国科学院沈阳自动化研究所
作者部门: 先进制造技术研究室
中文摘要: 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.
产权排序: 1
内容类型: 学位论文
URI标识: http://ir.sia.cn/handle/173321/9538
Appears in Collections:工业信息学研究室_先进制造技术研究室_学位论文

Files in This Item:
File Name/ File Size Content Type Version Access License
Models and Algorithms for Capacitated Lot Sizing Problems.pdf(679KB)----限制开放 联系获取全文
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Liu X(刘晓)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Liu X(刘晓)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2016  中国科学院沈阳自动化研究所 - Feedback
Powered by CSpace