允許缺貨後補之產能擴張問題; Capacity expansion problems with backlogging

NCU Institutional Repository > 管理學院 > 工業管理研究所 > 博碩士論文 > Item 987654321/60444

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/60444

题名:	允許缺貨後補之產能擴張問題;Capacity expansion problems with backlogging
作者:	李承浩;Lee,Cheng-Hao
贡献者:	工業管理研究所
关键词:	產能擴充;缺貨候補;分支界限;Capacity Expansion;Backlogging;Branch and Bound
日期:	2013-07-23
上传时间:	2013-08-22 11:37:36 (UTC+8)
出版者:	國立中央大學
摘要:	對於製造業而言，產能擴張一直是值得注意的問題，但產能擴充往往需要投下大量成本，此外仍有其它因子如勞力、原物料、需求變化等會影響總成本。因此每項決定都需要有通盤的考量，整體決策因而訂定。在本文中，我們想要知道在允許暫時性的缺貨情形下，要如何對整體進行規劃以及盡可能減少閒置的情形發生。利用整數規劃模型以及分枝界限的技巧來求解以及獲得最佳成本的決策方向。 Capacity expansion is always a considerable decision among manufacturing organizations, but implementing expansion is usually accompanied with a great deal of cost. Besides, there are lots of factors affect the total cost we may spend such as labor cost, raw material cost, demand variation, etc. Therefore decisions should be made through considering all the factors and as carefully as possible. Finally the expansion strategy will arise. Our research is based on the policy using inventory to postpone capacity expansion. We want to know what if we simultaneously allow temporary shortage and we want to reduce idle situations as much as possible. Then we make a trade-off among these strategies by constructing an integer programming model. At last we develop an algorithm that combines binary search tree and stepping stone method to solve our problem.
显示于类别:	[工業管理研究所 ] 博碩士論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	601	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....