查詢結果分析
相關文獻
- 運用循環週期法求解損耗品經濟批量排程問題之探討
- On the Joint Replenishment Problem under General-Integer Policy
- Effect of Cell Transfer Batches on Group Scheduling in a Flow Shop Cellular System
- On the Feasibility Testing of the Economic Lot Scheduling Problem Using the Extended Basic Period Approach
- 瓶頸迴流前後作業之最佳作業間隔模式研究
- 流程型工廠單產品批量流最佳解與探索解模式之研究
- 零工型工廠以工作為導向的啟發式排程系統之構建
- A Genetic Algorithm for Solving the Economic Lot Scheduling Problem with Reworks
- An Improved Heuristic for Solving the Economic Lot Scheduling Problem in Flow Shops under Power-of-Two Policy
- An Improved Heuristic for Solving the Conomic Lot Scheduling Problem in Flow Shops under Power-of-Two Policy
頁籤選單縮合
題 名 | 運用循環週期法求解損耗品經濟批量排程問題之探討=On the Economic Lot Scheduling Problem with Deteriorating Items |
---|---|
作 者 | 姚銘忠; 黃建雄; | 書刊名 | 管理學報 |
卷 期 | 20:2 2003.04[民92.04] |
頁 次 | 頁289-318 |
分類號 | 494.542 |
關鍵詞 | 批量; 排程; 損耗性存貨; 循環週期法; Deterioration; Lot size; Scheduling; The rotation cycle approach; |
語 文 | 中文(Chinese) |
中文摘要 | 經濟批量排程問題(economic lot scheduling problem;ELSP)的最佳化求解已被證明是一個具NP-hard複雜度的問題。在過去一般的ELSP模式中,大都假設存貨可以無限期的儲存,並未考慮產品具有損耗性。但是在現實生活中,常見產品具有損耗性;本研究在此前提假設下,使用循環週期法找出損耗品ELSP模式下的最佳解。本研究並推導出在若干特定條件下,運用循環週期法的封閉解(closed-form solution)即為損耗品ELSP模式之最佳解。同時,本研究亦對於所推導之特定條件進行敏感度分析,探討特定條件被寬鬆後,循環週期法所得之解與最佳解間誤差之上限。另外,本研究延伸上述損耗品ELSP模式的推導,以「可運用於整備的機台時間」定義機台產能限制,並允許延遲的補貨;依此,本研究亦推導出在何種特定條件下,使用循環週期法亦可得到最佳解。 |
英文摘要 | The Economic Lot Scheduling Problem (ELSP) is concerned with the lot sizing and scheduling decision of n items. It has been proved that the ELSP is an NP-hard problem. In the conventional ELSP model, the product stock does not deteriorate over time. The focus of this study is to employ the rotation cycle (RC) approach to solve the ELSP with deteriorating items. The RC approach secures a feasible production schedule in which each item shares the same replenishment cycle. We show that the RC approach’s schedule is optimal for in many realistic situations. Importantly, we give upper bounds for the maximum percentage that the RC approach’s schedule deviates from optimality. On the other hand, we extend our theoretical analysis to include the machine capacity constraint by considering the long run proportion of time available for setups. We also show how these results can be used when backorders are allowed. |
本系統中英文摘要資訊取自各篇刊載內容。