帳號:guest(3.138.67.97)          離開系統
字體大小: 字級放大   字級縮小   預設字形  

詳目顯示

以作者查詢圖書館館藏以作者查詢臺灣博碩士論文系統以作者查詢全國書目
作者(中文):李育真
作者(外文):Li, Yu-Chen
論文名稱(中文):線性規劃生產計劃之生產期端點在製品負荷建模技術
論文名稱(外文):A Modeling Technique of Period Boundary WIP Loading for Linear Programming Production Planning
指導教授(中文):洪一峯
指導教授(外文):Hung, Yi-Feng
口試委員(中文):吳建瑋
張國浩
口試委員(外文):Wu, Chien-Wei
Chang, Kuo-Hao
學位類別:碩士
校院名稱:國立清華大學
系所名稱:工業工程與工程管理學系
學號:105034505
出版年(民國):107
畢業學年度:106
語文別:英文
論文頁數:66
中文關鍵詞:生產計劃線性規劃前置時間產能負荷在製品工作量
外文關鍵詞:production planninglinear programminglead timecapacity loadingWIP workload
相關次數:
  • 推薦推薦:0
  • 點閱點閱:185
  • 評分評分:*****
  • 下載下載:0
  • 收藏收藏:0
生產計劃(Production Planning)是指在有限的可用生產資源下,為了盡可能即時滿足客戶訂單與最小化成本等,對生產系統中的材料、機器設備和勞動力進行配置的計劃。為了考慮線性規劃生產計劃(Linear Programming Production Planning, LPPP)模型中的前置時間(Lead Time)效應並解決所謂的循環議題,現有文獻提出了兩類方法。一種是迭代模擬方法的線性規劃模型;另一個是清理函數(Clearing Function, CF)方法。然而,現有這兩種方法在求解過程中都忽略了在製品(Work-in-process, WIP)在週期的端點所產生的工作量(Workload),如此一來可能會造成計劃和模擬(實際)情況之間的偏差。因此,為了精確建立週期的產能限制式,本文研究了在週期邊界仍在加工中的在製品工作量。
在週期中的在製品批次是指那些無法在同一個週期中完工的批次,而在製品批次的加工時間會造成不同週期的產能負荷。在週期邊界前的加工時間應消耗在該邊界前的週期產能,在週期邊界後的加工時間應消耗在該邊界後的週期產能。因此,在製品的批次工作量在不同週期的分布由加工時間(輸入與輸出的時間間隔)與週期的長度決定。一段週期的工作量是週期邊界前後所造成的在製品批次工作量與同時在該週期輸入與輸出的批次工作量所組成。本研究透過模擬實驗來測試與驗證此建模技巧是否有效,而由於相較於清理函數之數學模型容易求解,因此應用本研究提出之建模技術之模型較清理函數節省了87%的時間且表現良好。
Production planning makes the decisions related to the allocation of various resources, such as materials, machines and labor, in a production system to fulfill customer orders as on-time as possible with the objective of minimizing costs under limited available resources. To consider lead time effects in linear programming production planning (LPPP) models or to solve the so called circularity issue, two classes of approaches were proposed in existing literatures. One is LP simulation iteration approaches; the other one is clearing function (CF) approaches. However, these two classes of existing approaches ignore the workload generated by the work-in-process (WIP) at the boundaries of periods, which may cause deviations between planned outs and simulation/actual outs. Hence, to properly model the capacity constraints in periods, this study accurately calculates the workloads in the periods that account for the processing of WIP at a period boundary.
WIP lots at period boundaries refer to those lots that cannot complete in the same period. The processing time of a WIP lot contributes to the workloads of various periods. The portion of the processing time before the boundary should charge the capacity of the periods before the boundary, and the portion of the processing time after the boundary should charge the capacity of the periods after the boundary. Hence, the workload of a period consists of those from the WIP lots at the beginning and ending boundaries of the period, plus those from the lots both inputted and outputted in the period. The distributions of a WIP lot to various periods is determined by the relationship between processing time (input-output time lag) and period length. This study tests and validates the effectiveness of the proposed modeling technique by simulation experiments. This study performs well and saves 87% of the computation time of CF because of lower difficulty for solving mathematical model.
摘要 I
Abstract II
TABLE OF CONTENTS IV
LIST OF FIGURES VI
LIST OF TABLES VI
1. Introduction 1
1.1. Linear programming production planning 1
1.2. Lead time issue in production planning 4
1.3. Motivations of this study 6
2. Literature Review 9
2.1. Production planning model with iterative method 9
2.2. Production planning model with clearing function method 11
3. Method 16
3.1. Input-output relation modeling technique 16
3.2. Capacity-constrained parameter calculation 20
3.3. Input-output-relation-constrained parameter calculation 33
3.4. LPPP model 36
4. Experiments and result analysis 41
4.1. Parameters setting 42
4.1.1. Parameters of constraints for LPPP 42
4.1.2. Parameters for simulation 47
4.2. Experiment design 48
4.2.1. Simulation model 48
4.2.2. Experimental procedure 49
4.3. Result and analysis 50
4.3.1. Calculation of experiment responses 50
4.3.2. Calculation of objective value 52
4.3.3. Experiment results 53
4.3.4. Factor analysis 55
5. Conclusion and future research 61
Reference 63
Albey, E., Bilge, U., and Uzsoy, R. (2014), “An exploratory study of disaggregated clearing functions for production systems with multiple products”, International Journal of Production Research, Vol. 52, No. 18, pp. 5301-5322.
Asmundsson, J., Rardin, R. L., and Uzsoy, R. (2006), “Tractable nonlinear production planning models for semiconductor wafer fabrication facilities”, IEEE Transactions on Semiconductor Manufacturing, Vol. 19, No. 1, pp. 95-111.
Asmundsson, J., Rardin, R. L., Turkseven, C. H., and Uzsoy, R. (2009), “Production planning with resources subject to congestion”, Naval Research Logistics, Vol. 56, No. 2, pp. 142-157.
Byrne, M. D. and Bakir, M. A. (1999), “Production planning using a hybrid simulation-analytical approach”, International Journal of Production Economics, Vol. 59, No. 1, pp. 305-311.
Graves, S. C. (1986), “A tactical planning model for a job shop”, Operations Research, Vol. 34, No. 4, pp. 522-533.
Hackman, S. T. and Leachman, R. C. (1989), A general framework for modeling production”, Manage. Sci., vol. 35, pp. 478–495.
Hung, Y. F. and Chang, C. B. (1999), “Using an empirical queueing approach to predict future flow times”, Computers and Industrial Engineering, Vol. 37, No. 4, pp. 809-821.
Hung, Y. F. and Hou, M. C. (2001), “A production planning approach based on iterations of linear programming optimization and flow time prediction”, Journal of the Chinese Institute of Industrial Engineers, Vol. 18, No. 3, pp. 55-67.
Hung, Y. F. and Leachman, R. C. (1996), “A production planning methodology for semiconductor manufacturing based on iterative simulation and linear programming calculations”, IEEE Transactions on Semiconductor Manufacturing, Vol. 9, No. 2, pp. 257-269.
Ioannou, G., Dimitriou, S. (2012), “Lead time estimation in MRP/ERP for make-to-order manufacturing systems”, International Journal of Production Economics, Vol.139, No.2, pp. 551-563.
Johnson, L. A. and Montgomery, D. C. (1974), Operations Research in Production Planning, Scheduling and Inventory Control. New York: Wiley.
Kacar, N. B. and Uzsoy, R. (2015), “Estimating clearing functions for production resources using simulation optimization”, IEEE Transactions on Automation Science and Engineering, Vol. 12, No. 2, pp. 539-552.
Kacar, N. B., Irdem, D. F., and Uzsoy, R. (2012), “An experimental comparison of production planning using clearing functions and iterative linear programming-simulation algorithms”, IEEE Transactions on Semiconductor Manufacturing, Vol. 25, No. 1., pp. 104-117.
Kacar, N. B., Mönch, L., and Uzsoy, R. (2016), “Modeling Cycle Times in Production Planning Models for Wafer Fabrication”, IEEE Transactions on Semiconductor Manufacturing, Vol. 29, No. 2., pp. 153-167.
Kang, Y., E. Albey, S. Hwang, and R. Uzsoy. (2014). “The impact of lot-sizing in multiple product environments with congestion”. Journal of Manufacturing Systems 33 (3): 436–444.
Karmarkar, U. S. (1989), “Capacity loading and release planning with work-in-progress (WIP) and lead-times”, Journal of Manufacturing and Operations Management, Vol. 2, No. 2, pp. 105-123.
Kim, B. and Kim, S. (2001), “Extended model for a hybrid production planning approach”, International Journal of Production Economics, Vol. 73, No. 2, pp. 165-173.
Kim, S. H., Kim, J. H. and Lee, Y. H. (2014), “Simulation-based optimal production planning model using dynamic lead time estimation”, The International Journal of Advanced Manufacturing Technology, Vol. 75, pp. 1381–1391. NO
Pahl, J., Voß, S., and Woodruff, D. L. (2005), “Production planning with load dependent lead times”, A Quarterly Journal of Operations Research, Vol. 3, No. 4, pp. 257-302.
Pahl, J., Voß, S., and Woodruff, D. L. (2007), “Production planning with load dependent lead times: an update of research”, Annals of Operations Research, Vol. 153, No. 1, pp. 297-345.
Selçuk, B., Fransoo, J. C., and De Kok, A. G. (2008), “Work-in-process clearing in supply chain operations planning”, IIE Transactions, Vol. 40, No. 3, pp. 206-220.
Srinivasan, A., Carey, M., and Morton, T.E. (1988), Resource pricing and aggregate scheduling in manufacturing systems, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992), “A review of production planning and scheduling models in the semiconductor industry part I: system characteristics”, performance evaluation and production planning. IIE transactions, 24(4), 47-60.
Voss, S. and Woodruff, D. L. (2003), Introduction to Computational Optimization Models for Production Planning in a Supply Chain, Berlin, Germany: Springer.
Wang, P. Y. (2015), Simulation Experiments of Clearing Function Production Planning Approaches with Dispatching Rules, Master thesis, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, ROC.
Wu, P. Y. (2016), Accuracy Comparisons of Several Clearing Function Production Planning Approaches, Master thesis, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, ROC.
Wang, T.J. (2017), Simulation Comparisons of Production Planning Models with Multiple Dimension Clearing Functions, Master thesis, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, ROC.
(此全文未開放授權)
電子全文
中英文摘要
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
* *