https://scholars.lib.ntu.edu.tw/handle/123456789/105201
標題: | 供應鍊管理多目標主規劃排程問題之研究 | 作者: | 陳靜枝 | 關鍵字: | 供應鏈管理;先進規劃排程;主規劃排程;線性規劃;啟發性演算法;Supply Chain Management;Master Planning;Heuristic Algorithm;Advanced planning and scheduling (APS);Multiple-goal Optimization | 公開日期: | 2004 | 出版社: | 臺北市:國立臺灣大學資訊管理學系暨研究所 | 摘要: | 本研究採用先進規劃排程的觀念,同步考慮訂單需求與產能分配下處理多張訂單在供應鏈中的主規劃排程;並釋放了訂單一定要在交期前完成的限制,成為在訂單延遲最少的前提下尋找總成本最低排程計劃的多目標最佳化問題。由於此類供應鏈網路的問題一般採用線性規劃模式或混合整數線性規劃模式搭配目標規劃方式來求取最佳解,但隨著供應鏈網路問題的複雜度增加,線性規劃模型中的變數與限制式個數快速成長,通常會使模型需要花費大量的時間來求解。因此本研究在描述問題同時也將提出問題的線性規劃模型,此外並提出一啟發性演算法,以快速地解決供應鏈網路下主規劃排程的問題。 This study focuses on the master planning of “Advanced planning and scheduling.” By considering a final product and its relationship with the global supply chain structure, the first objective is to minimize the total delays of orders, and the second objective is to minimize the sum of production cost, processing cost, transportation cost and inventory holding cost under the constraints of limited capacities. In the previous studies, “Linear Programming,” “Mixed Integer Linear Programming” and “Goal Programming” are popular used to solve these kinds of problems related to supply chain management. However, with the increasing complexities of the supply chain related problems, the numbers of variables and constraints in the LP models grow rapidly. It takes a lot of computer time to solve these problems if there are feasible. Nevertheless, if the LP models result to no feasible solutions, the cause of infeasible can not be identified. Therefore, this study proposes a heuristic algorithm that is more informative and flexible then LP to solve supply chain related problems. The heuristic algorithm can indicate the status of orders and allocations of capacities and searches out feasible solutions more quickly. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/18845 | 其他識別: | 922416H002013 | Rights: | 國立臺灣大學資訊管理學系暨研究所 |
顯示於: | 資訊管理學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
922416H002013.pdf | 242.17 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。