查詢結果分析
來源資料
頁籤選單縮合
題 名 | A Backward Approach Lpc-based Constructive Heuristic=後向式之短週期成本為基礎之建構式啟發式演算法 |
---|---|
作 者 | Ho, Johnny C.; Tseng, Tzu-liang (Bill); Ruiz-torres, Alex J.; López, Francisco J.; | 書刊名 | 工業工程學刊 |
卷 期 | 25:4 2008.07[民97.07] |
頁 次 | 頁275-286 |
分類號 | 494.57 |
關鍵詞 | 批量大小; 啟發式演算法; 物料需求計劃; 實證結果; Lot-sizing; Heuristics; Material requirements planning; Empirical results; |
語 文 | 英文(English) |
中文摘要 | 在本論文中,我們建議用一個啟發式演算法來求解一個非常出台的單一階段無產能限制的動態批量問題。所發展之演算法係基於Silver and Meal [18]所提出之平均期間成本準則,也就是眾所皆知的最短週期成本(Least Period Cost, LPC)。所提出之演算法具有二個令人滿意的特徵,那就是簡單性及能有效率地解決互補最短週期成本。我們藉由使用20 個由Baker [2] 和 Berry [3]所產生之標竿問題,來檢視所發展之演算法之效率。更進一步地,我們執行大模規之模擬,此一模擬中包含了80,000個亂數產生的問題,來比較所發展之演算法興數個在文獻中非常流行的演算法。我們的計算結果顯示所建議之啟發式演算法能夠取得高的競爭結果。 |
英文摘要 | In this paper, we propose a heuristic for the well-known single-level un-capacitated dynamic lot-sizing problem. The proposed heuristic is based on the average period cost criterion introduced by the heuristic from Silver and Meal [18], also known as Least Period Cost (LPC). Two desirable features of the proposed heuristic are simplicity and the heuristic's ability to complement LPC effectively. We examine the effectiveness of the proposed heuristic by using a set of 20 benchmarking test problems attributed to Baker [2] and Berry [3]. Furthermore, we perform a large-scale simulation involving 80,000 randomly generated problems to evaluate the proposed heuristic against several popular heuristics in the literature. Our computational results show that the proposed heuristic is able to achieve highly competitive results. |
本系統中英文摘要資訊取自各篇刊載內容。