簡易檢索 / 詳目顯示

回結果列表
研究生： 賴志皓
Lai, Chih-Hao
論文名稱： 考量順序相依整備時間與期初存貨之產能限制批量排程問題
Capacitated Lot-Sizing and Scheduling Problems with Sequence-Dependent Setup Time and Initial Inventory
指導教授： 陳茂生
Chern, Maw-Sheng
口試委員: 周瑋民
林妙聰
葉維彰
楊達立
學位類別： 碩士
Master
系所名稱： 工學院 - 工業工程與工程管理學系
Department of Industrial Engineering and Engineering Management
論文出版年： 2011
畢業學年度： 99
語文別： 英文
論文頁數： 106
中文關鍵詞： 產能限制批量排程問題 、混整數規劃 、順序相依 、整備時間 、期初存貨 、平行機台 、流水線
外文關鍵詞： Lot -sizing and scheduling, Mixed-integer programming, Sequence-dependent, Settup time, Initial inventory, Parallel machine, Flow shop
相關次數： 點閱：2  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 本論文主要考慮單一機台(single-machine)產能限制批量排程問題(capacitated lot-sizing and scheduling)，它其包含順序相依整備時間(sequence-dependent setup time)以及期初存貨條件。我們提供一個方法將問題轉換成一個沒有期初存貨的問題。對於小型問題，我們建構一個混整數規劃模式，此模式將比文獻中舊有的模式更一般化。對於大型問題，我們提出一個啟發式演算法，它能夠在合理的時間內找到可行解。這個方法分成兩個階段，第一階段利用一個後推式方法產生一個好的可行解，接著在第二階段對此解做進一步改善。這個啟發式方法也被應用在平行機台問題(parallel machine)與流水線問題(flow shop)。

    In this thesis we mainly consider single-machine capacitated lot-sizing and scheduling problems with initial inventory and sequence-dependent setup time. We provide a simple procedure to convert the problem into the one without initial inventory. To deal with small size problem we propose a mixed-integer programming formulation which generalizes the former models in the literatures. For large-scale programs, we provide a heuristic method which will generate a feasible schedule in reasonable time. The heuristic comprises two stages. In stage one a backward method is used to generate a good feasible schedule and the schedule is refined in stage two. Moreover, the proposed problem and algorithm are extended to parallel-machine and flow shop problems.

    摘要 Abstract 1 Introduction 1.1 Research Background 1.2 Research Motivation 1.3 Research Scope and Assumptions 1.4 Research Method 1.5 Framework 2 Literature Review 2.1 Lot-sizing and Scheduling Problems 2.1.1 Basic Lot-Sizing and Scheduling Model 2.1.2 Capacitated Lot-Sizing Problem (CLSP) 2.1.3 The CLSP with Linked Lots (CLSPL) 2.1.4 The Discrete Lot-Sizing and Scheduling Problem (DLSP) 2.1.5 The Continuous Setup Lot-Sizing Problem (CSLP) 2.1.6 The Proportional Lot-Sizing and Scheduling Problem (PLSP) 2.1.7 Models with Setup Times and Sequence-Dependent Setup Times 2.1.8 Summary 2.2 Algorithms 2.2.1 Exact Methods 2.2.2 Common-Sense or Specialized Heuristics 2.2.3 Mathematical Programming-Based Heuristics 2.2.4 Summary 2.3 Parallel Machine Problems 2.4 Flow Shop Problems 3 Mathematical Model and Solution Method 3.1 Problem Description, Notations and Assumptions 3.2 A Simple Procedure for Initial Inventory Simplification 3.3 Mathematical Model 3.4 Solution Method 3.4.1 The Backward Method 3.4.2 The Improvement Procedure 3.5 Numerical Example 3.6 Summary 61 3.7 Computational Experiment 3.7.1 Test Problems 3.7.2 Computational Experiments 4 Parallel Machine Problems 4.1 Problem Description, Notations and Assumptions 4.2 Mathematical Model 4.3 Solution Method 4.4 Numerical Example 5 Flow Shop Problems 5.1 Problem Description, Notations and Assumptions 5.2 Solution Method 5.3 Numerical Example 6 Conclusion and Future Research Appendix I The Backward Method II The Improvement Procedure III The Backward Method for Parallel Machine Problems References

    Almada-Lobo, B., Oliveira, J. and Carravilla, M.A. (2008), A note on “the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times”, Computers and Operations Research, 35, 1374-1376.

    Barany, I., Van Roy, T.J. and Wolsey, L.A. (1984), Strong formulations for multi-item capacitated lot-sizing, Management Science, 30(10), 1255-61.

    Bitran, G.R. and Matsuo, H. (1986), Approximation formulations for the single-product capacitated lot-size problem, Operations Research, 34, 63-74.

    Bitran, G.R. and Yanasse, H.H. (1982), Computational complexity of the capacitated lot-size problem, Management Science, 28(10), 1174-1186.

    Billington, P.J., McClain, J.O. and Thomas, L.J. (1983), Mathematical programming approaches to capacity constrained MRP systems: review, formulation and problem reduction, Management Science, 29, 1126-1141.

    Buschkühl, L., Sahling, F., Helber, S. and Tempelmeier, H. (2010), Dynamic capacitated lotsizing problems: a classification and review of solution approaches, OR Spectrum, 32 (2), 231-261.

    Carreno, J.J., (1990), Economic lot scheduling for multiple products on parallel identical processors, Management Science, 36, 348-358.

    Chen, W.H. and Thizy, J.M. (1990), Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research, 26, 29-72.

    Drexl, A. and Haase, K. (1995), Proportional lotsizing and scheduling, International Journal of Production Economics, 40, 73-87.

    Drexl, A. and Haase, K. (1996), Sequential-analysis based randomized regret-methods for lot-sizing and scheduling, Journal of the Operational Research Society, 47, 251-265.

    Drexl, A. and Kimms, A. (1997), Lot-sizing and scheduling – Survey and extensions, European Journal of Operational Research, 99, 221-235.

    Eisenhut, P.S. (1975), A dynamic lot-sizing algorithm with capacity constraints, IIE Transactions, 7(2), 170–6.

    Eppen, G.D. and Martin, R.K. (1987), Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations Research, 35(6), 832-48.

    Fandel, G. and Stammen-Hegene, C. (2006), Simultaneous lot-sizing and scheduling for multi-product multi-level production, International Journal of Production Economics, 104(2), 308-316.

    Fleischmann, B. (1990), The discrete lot-sizing and scheduling problem, European Journal of Operational Research, 44(3), 337-348.

    Florian, M., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1980), Deterministic production planning algorithms and complexity, Management Science, 26(7), 669-679.

    Gupta, D. and Magnusson, T. (2005), The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Computers and Operations Research, 32, 727-747.

    Haase, K. (1994), Lotsizing and Scheduling for Production Planning, Lecture Notes in Economics and Mathematical Systems, vol. 408, Springer, Berlin.

    Haase, K. (1996), Capacitated lot-sizing with linked production quantities of adjacent periods, Technical report, Working Paper 334, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Germany.

    Haase, K. and Kimms, A. (2000), Lot-sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities, International Journal of Production Economics, 66, 159-169.

    Kaczmarczyk, W. (2009), Practical Tips for Modelling Lot-Sizing and Scheduling Problems, Decision Making in Manufacturing and Sciences, 3, 37-48.

    Karimi, B., Fatemi Ghomi, S.M.T. and Wilson, J.M. (2003), The capacitated lot-sizing problem a review of models and algorithms, Omega, 31, 365-378.

    Karmarkar, U.S., Kekre, S. and Kekre, S. (1987), The dynamic lotsizing problem with startup and reservation costs, Operations Research, 35(3), 389-398.

    Kimms, A. (1996), Multi-level, single-machine lot-sizing and scheduling (with initial inventory), European Journal of Operational Research, 89, 86-99.

    Kirca, O. and Kokten, M. (1994), A new heuristic approach for the multi-item dynamic lot-sizing problem, European Journal of Operational Research, 75(2), 332-41.

    Kovács, A., Brown, K.N. and Tarim, A. (2009), An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups, International Journal of Production Economics, 118, 282-291.

    Lasdon, L.S. and Terjung, R.C. (1971), An efficient algorithm for multi-item scheduling, Operations Research, 19(4), 946-969.

    Leung, J.M.Y., Magnanti, T.L. and Vachani, R. (1989), Facets and algorithms for capacitated lot-sizing, Mathematical Programming, 45, 331–59.

    Maes, J. and Van Wassenhove, L. (1988), Multi-item single-level capacitated dynamic lot-sizing heuristics a general review, Journal of the Operational Research Society, 39(11), 991–1004.

    Maes, J. and Van Wassenhove, L.N. (1986), A simple heuristic for the multi-item single level capacitated lot-sizing problem, Operations Research Letters, 4(6), 265-73.

    Maes, J., McClain, J.O. and Van Wassenhove, L.N. (1991), Multilevel capacitated lotsizing complexity and LP-based heuristics, European Journal of Operational Research, 53, 131-148.

    Meyr, H. (2002), Simultaneous lotsizing and scheduling on parallel machines, European Journal of Operational Research, 139, 277-292.

    Mohammadi, M., Fatemi Ghomi, S.M.T., Karimi, B. and Torabi, S.A. (2010), MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups, International Journal of Production Research, 48(10),. 2957-2973.

    Salomon, M., Kroon, L.G., Kuik, R. and van Wassenhove, L.N. (1991), Some extensions of the discrete lotsizing and scheduling problem, Management Science, 37, 801-812.

    Sarker, B.R. and Yu, J. (1996), Lot-sizing and cyclic scheduling for multiple products in a flow shop, Computers and Industrial Engineering, 30(4), 799-808.

    Sox, C.R. and Gao, Y. (1999), The capacitated lot-sizing problem with setup carry-over, IIE Transactions, 31(2), 173-181.

    Staggemeier, A.T. and Clark, A.R. (2001), A Survey of lot-sizing and scheduling models, 23rd Annual Symposium of the Brazilian Operational Research Society, Campos do Jordão, Brazil.

    Suerie, C. and Stadtler, H. (2003), The capacitated lot-sizing problem with linked sizes, Management Science, 49(8), 1039-1054.

    Sung, C.S. (1986), A single-product parallel-facilities production-planning model, International Journal of Systems Science, 17, 983-989.

    Süral, H., Denizel, M., and Van Wassenhove, L.N. (2009), Lagrangean relaxation based heuristics for lot-sizing with setup times, European Journal of Operational Research, 194, 51-63.

    Thizy, J.M. and Van Wassenhove, L.N. (1985), Lagrangean relaxation for the multi-item capacitated lot-sizing problem a heuristic implementation, IIE Transactions, 17(4), 308-313.

    Toledo, F.M.B. and Armentano, V.A. (2006), A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, European Journal of Operational Research, 175, 1070-1083.

    Trigeiro, W.W. (1989), A simple heuristic for lot-sizing with setup times, Decision Science, 20, 294-303.

    Trigeiro, W.W., Thomas, L.J. and McClain, J.O. (1989), Capacitated lot-sizing with setup times, Management Science, 35(3), 353-366.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)
    QR CODE