| DC 欄位 |
值 |
語言 |
| DC.contributor | 工業管理研究所 | zh_TW |
| DC.creator | 李承浩 | zh_TW |
| DC.creator | Cheng-Hao Lee | en_US |
| dc.date.accessioned | 2013-7-23T07:39:07Z | |
| dc.date.available | 2013-7-23T07:39:07Z | |
| dc.date.issued | 2013 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=100426022 | |
| dc.contributor.department | 工業管理研究所 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 對於製造業而言，產能擴張一直是值得注意的問題，但產能擴充往往需要投下大量成本，此外仍有其它因子如勞力、原物料、需求變化等會影響總成本。因此每項決定都需要有通盤的考量，整體決策因而訂定。在本文中，我們想要知道
在允許暫時性的缺貨情形下，要如何對整體進行規劃以及盡可能減少閒置的情形發生。利用整數規劃模型以及分枝界限的技巧來求解以及獲得最佳成本的決策方向。 | zh_TW |
| dc.description.abstract | 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. | en_US |
| DC.subject | 產能擴充 | zh_TW |
| DC.subject | 缺貨候補 | zh_TW |
| DC.subject | 分支界限 | zh_TW |
| DC.subject | Capacity Expansion | en_US |
| DC.subject | Backlogging | en_US |
| DC.subject | Branch and Bound | en_US |
| DC.title | 允許缺貨後補之產能擴張問題 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Capacity expansion problems with backlogging | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |