查詢結果分析
相關文獻
- Lot-Sizing with Quantity Discount-- Incremental Part-Period Approach
- 考慮數量折扣的動態經濟批量
- A Production Lot Size Model for Deteriorating Items with Time-Varying Demand
- 動態經濟批量之探討--最低總成本法
- 未來供給不確定下最佳經濟訂購批量訂定之研究
- A Note on Minimizing Batch Flow-time with Capacity Constraints
- Risk of Defective Items in Single-Period Inventory Problem: Mixture of Replacement and Lost Sales
- 不完備預防保養政策對老化生產系統之影響
- Dynamic Order Quantities--The Minimal Total Cost Approach
- 涵括數量折扣、額外積壓資金和隨機欠撥率的(Q,r,L)存貨模型
頁籤選單縮合
題名 | Lot-Sizing with Quantity Discount-- Incremental Part-Period Approach=考慮數量折扣的批量法則--遞增件期數法 |
---|---|
作者 | 黃士滔; 池福灶; | 書刊名 | 高雄工商專校學報 |
卷期 | 25 1995.12[民84.12] |
頁次 | 頁115-136 |
分類號 | 494.572 |
關鍵詞 | 批量; 數量折扣; FW演算法; 遞增件期數; Lot-size; Quantity discount; Fordyce-webster algorithm; Incremental part-period; |
語文 | 英文(English) |
中文摘要 | 應用件期數法則(Part-Period Algorithm, PPA)求解物料需求計劃系統(MRP) 的批量問題,所得到的解雖不是最佳解,但卻廣泛的被使用,主要原因是此一 演算法則具有簡單且易於使用的優點。本文即沿用無數量折扣時之遞增件期數 (Incremental Part-Period, IPP)觀念,增加數學邏輯的討論,建立考慮單一 數量折扣的遞增件期數模型。 透過將各期採購成本轉換為件期數表示法,並重新架構經濟件期數及遞增 件期數內容,可以推導出新的遞增件期數演算法則,實務上各期需求量可分批 採購,導至演算的複雜度增加,因此本文將數量折扣所導至的件期數變化以數 學方式進行完整的狀態分析,來顯示數量折扣的特性,並建立求解批量的法 則。此法則仍具有簡單且易於使用的特質,不因數量折扣因素而複雜化。此一 法則內容為當某一期儲存成本與採購成本所造成的件期數,若大於或等於訂購 成本與採購成本所造成的件期數,則當期採取重新採購的政策,否則,維持存 貨政策。 Fordyce-Webster(FW)方法証明其求解之總成本優於最低單位成本法 (LUC)但演算時間卻為LUC 法的2.33倍。本文應用新法則,採用模擬方法顯示 最佳解不亞於FW法則,但演算時間僅為其0.125倍,故應屬一簡單的好方法。 |
英文摘要 | Part-Period algorithm (PPA) is not the optimum solution in the MRP lo-sizing problem, but it is widely used due to the simplicity. This paper extends the concept of incremental part-periods without quantity discount to establish a model with quantity discount. We transform the ordering cost into the part-periods and redefine the economic-part-period to develop a new algorithm of incremental part-periods with quantity discount. Using a state analysis to show the characteristics of quantity discount, we present an incremental part-period algorithm. Including the factor of quantity discount, the new algorithm is still simple to be used. When the part-periods due to the summation of carrying costs and purchasing costs are larger than those due to the summation of ordering costs and purchasing costs, we will adopt a reorder policy. Fordyce-Webster(FW) algorithm proves that it is better than the least unit cost algorithm in total costs, but its computational efficiency is worse than that, Using simulation, the new algorithm is demonstrated that it is not worse than FW algorithm. The computation time of the new algorithm is highly shorter than FW algorithm. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。