:::

詳目顯示

回上一頁
題名:靈活製造環境下快速變換生產線最佳生產策略之研發與構建
作者:林添佑
校院名稱:國立中正大學
系所名稱:企業管理研究所
指導教授:陳明德
陳武林
學位類別:博士
出版日期:2003
主題關鍵詞:靈活製造換線排程批量數理規劃班德氏解構法麥可丹尼爾解構法agile manufacturingchangeoverschedulinglot sizingmathematical programmingBenders decompositionMcDaniel decomposition
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:272
在這一篇論文中,我們發展一個數理規劃的〝若─則〞模式來解決一條生產線在靈活製造環境下生產不同產品的排程問題;在這個模式下,需求被假設為確定性的動態情形且允許欠撥;而由產品別或順序別來決定的換線成本在模型中是重要而不可被忽略的。因此,我們的目標是找尋最適生產策略來最小化總製造成本,包括啟動成本、生產成本、設置成本、換線生產、生產水準變化成本、解雇成本、晉用成本、勞力成本、缺貨成本和存貨成本等相關成本。由於發展的數理規劃模型可以完全將換線成本和上述成本緊密結合,所以我們的數理規劃模型比現有文獻記載的模型更完整,而且可以提供決策者在靈活製造環境下來決定生產排程,批量提供勞力水準及缺、存貨等相關資訊。
包含〝二次式模型〞、〝時間跨距網路模型〞及〝縮減變數模型〞的三個修正數理規劃模型被我們依系統特性構建來嘗試改善計算的效率。而以班德氏和麥可丹尼爾解構法為基礎的兩個演算法同時也在論文中被發展來解決大型的問題。
除此之外,一個允許在大週期內可生產多種產品,但在小週期內僅能生產一種產品的一般化模型也被我們發展出來。此模型縮減了現場排程和傳統總體生產規劃的間隙,同時也提供了短期與中期規劃銜接的重要工具。
關鍵詞:靈活製造、換線、排程、批量、數理規劃、班德氏解構法、麥可丹尼爾解構法
In this dissertation, a mathematical programming formulation, named If-Then model, was proposed for scheduling a production line (or workstation) capable of producing a variety of different products in an agile manufacturing environment. Demand is assumed dynamic but deterministic and can be backordered. Changeover costs can be product-dependent or sequence-dependent and cannot be neglected. The objective is to find an optimal strategy that minimizes the total manufacturing costs and/or times including startup costs, production costs, setup costs, changeover costs, change-level costs, layoff and hiring costs, labor costs, back-order costs, and storage costs. The developed math-programming models are more comprehensive than the existing ones, since they fully captured each type of costs associated with changeovers as described above. The proposed optimal strategy provides decision-maker the essential information including production schedule, lot size, workforce level, and periodic inventory or back-order for each product.
Based on the system characteristics, three modified math-programming models including quadratic model, time-spanning network model and reduced-variable model were constructed to improve the computational efficiency. Two algorithms based on Benders and McDaniel decompositions were also developed to assist in solving the large-scale problems.
In addition, a generalized model, in which multiple products can be manufactured in a “macro-period” while only one product is allowed in a “micro-period,” was developed. It bridges the gaps between the shop floor scheduling and the traditional aggregate production planning, and is suited for both the short-term and medium-term planning horizon.
References
Aardal, K., and Larsson, T., 1990, “A Benders decomposition based heuristic for the hierarchical production planning problem,” European Journal of Operational Research, 45, 1, 4-14.new window
Aghezzaf, E. H., 2000, “Lot-sizing problem with setup times in labor-based capacity production systems,” International Journal of Production Economics, 64, 1-9.
Akinc, U., and Roodman, G. M., 1986, “A new approach to aggregate production planning,” IIE Transactions, 18, 1, 88-94.new window
Alguacil, A., and Conego, A. J., 2000, “Multi-period optical power flow using Benders decomposition,” IEEE Transactions on Power Systems, PWRS-15, 1, 16-25.new window
Bakir, M. A., and Byrne, M. D., 1994, “An application of the multi-stage Monte Carlo optimization algorithm to aggregate production planning,” International Journal Production Economics, 35, 1-3, 207-213.
Benchakroun, A., Ferland, J. A., and Cleroux, R., 1991, “Distribution system planning through a generalized Benders decomposition approach,” European Journal of Operational Research, 62, 149-162.
Benders, J. F., 1962, “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik, 4, 238-252.
Bergstrom, G. L., and Smith B. E., 1970, “Multi-item production ─ an extension of the HMMS rule,” Management Science, 16, B614-B629.
Bitran, G. R. Haas, E. A., and Hax, A. C., 1982, “Hierarchical production planning: a two —stage system,” Operations Research, 30, 2, 232-251.
Blocher J. D., and Chand, S, 1996, “Forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem,” European Journal of Operational Research, 91, 3, 456-470.
Blocher J. D., Chand, S, and Sengupta, K., 1999, “The changeover scheduling problem with time and cost considerations: analytical results and a forward algorithm,” Operations Research, 47, 4, 559-569.
Booth, C., and Hammer, M., 1995, “Agile manufacturing concepts and opportunities in ceramics,” Ceramic Transactions, 50, 67-76.
Bowman, E.H., 1956, "Production scheduling by the transportation method of linear programming," Operations Research, 4, 1, 471-479.new window
Bradley, S. P., Hax, A. C., and Magnanti, T. L., 1976, Applied mathematical programming, Addison-Wesley Publishing Company.
Buffa, E. S., and Miller, J. G., 1979, Production inventory systems: Planning and control, 3rd Edition, Homewood Illinois: Richard D. Irwin, Inc.
Burgess, T. B., 1994, “Making the leap to agility: defining and achieving agile manufacturing through business process redesign and business network redesign,” International Journal of Operations and Production Management, 14, 11, 23-34.
Cai, X., Mckinney, D. C., Lasdan, L. S., and Watkins, Jr. W., 2001, “Solving large non-convex water resources management models using generalized Benders decomposition,” Operations Research, 49, 2, 235-245.
Carraresi, P., and Gallo, G., 1982, “Optimal location of files and programs in computer networks,” Mathematical Programming Study, 20, 39-53.
Cattrysse, D. M., Salomon, R., Kuik, L., and VanWassenhove, L. N., 1993, “A dual ascent and column generation heuristic for the discrete lot-sizing and scheduling problem with setup times,” Management Science, 39, 4, 477-486.
Chakravarty, A. K. and Shtub, A., 1986, “Production planning with flexibilities in capacity,” Proceedings of the second ORSA/ TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Application, Amsterdam, 333-343.
Chung, C. H., Krajewski, L. J., 1984, “Planning horizons for master production scheduling,” Journal of Operations Management, 4, 4, 389-406.
Coleman, B. J., and McKnew M. A., 1995, “Quick and effective method for capacitated lot sizing with startup and reservation costs,” Computers & Operations Research, 22, 6, 641-653.
Deckro, R., and Hebert, J. E., 1984, “Goal programming approaches to solve linear decision rule based aggregate production planning models,” IIE Transactions, 16, 4, 308-315.
Dogan, K., and Goetschalckx, M., 1999, “A primal decomposition method for the integrated design of multi-period production—distribution systems,” IIE Transactions, 31, 11, 1027-1036.
Ebert, R. J., 1976, "Aggregate planning and learning curve productivity," Management Science, 23, 2, 171-182.
Elsayed, A., and Boucher, T. O., 1985, Analysis and control of production systems, New Jersey: Prentice-Hall.
Erenguc, S. S., Tufekci, S., and Zappe, C. J., 1993, “Solving time/cost trade-off problems with discounted cash flow using generalized benders decomposition,” Naval Research Logistics, 40, 25-50.
Florian, M., Bushell, G., Ferland, J., Guerin, G., and Nastansky, L., 1976, “Engine scheduling problem in a railway network,” INFOR Journal (Canadian Journal of Operational Research and Information Processing), 14, 2, 121-138.
Gaither, and Frazier, 2002, Operations Management, 9th ed., South-Western Publication.
Gallego, G., and Jonega, D., 1994, “Economic lot scheduling problem with raw material considerations,” Operations Research, 42, 92-101.
Gehani, R. R., 1995, “Time-based management of technology: A taxonomic integration of tactical and strategic roles,” International Journal of Operations & Production Management, 15, 2, 19-35.
Geoffrion, A. M., and Graves, G. W., 1974, “Multicommodity distribution system designs by Benders decomposition,” Management Science, 20, 5, 822-844.
Gilgeous, V., 1989, “Modeling realism in aggregate planning: a goal-search approach,” International Journal of Production Research, 27, 4, 1179-1193.
Goncalves, J. F., and Leachman, R. C., 1998, “A hybrid heuristic and linear programming approach to multi-product machine scheduling,” European Journal Of Operational Research, 110, 548-563.
Gonzalea, J. J., and Reeves, G. R., 1983, "Master Production Scheduling: A multiple-objective linear programming approach," International Journal of Production Research, 21, 4, 553-562.
Goodman, D. A., 1974(a), "A sectioning search approach to aggregate planning of production and work force," Decision Sciences, 5, 545-563.
Goodman, D. A., 1974(b), “A goal programming approach to aggregate planning of production and work force," Management Science, 20, 12, 1569-1575.
Gunasekaran, A., 1999, “Agile manufacturing: A framework for research and development,” International Journal Production Economics, 62, 1-2, 87-105
Habibollahzadeh, H., and Bubenko, J. A., 1986, “Application of decomposition techniques to short-term operation planning of hydrothermal power system,” IEEE Transactions on Power Systems, PWRS-1, 1, 41-47.new window
Hackman, S. T., and Leachman, R. C., 1989, "A general framework for modeling production," Management Science, 35, 4, 478-495.
Heragu S. S, and Chen J.-S., 1998, “Optimal solution of cellar manufacturing system design: Benders decomposition approach,” European Journal of Operational Research, 107, 176-192.
Hindi, K. S., 1995, “Algorithms for capacitated, multi-item lot-sizing without setups,” Journal of Operational Research Society, 46, 465-472.
Holt, C., Modigliani, F., and Simon, H., 1955, “A linear decision rule for production and employment scheduling,” Management Science, 2, 1-30.
Hummeltenberg, W., 1985, “Capital budgeting with Benders decomposition,” European Journal of Operational Research, 21, 3, 318-329.
Hwang, C. L., Fan, L. T., Tillman, F. A., and Sharma, R., 1969, “Optimal production planning and inventory control,” International Journal of Production Research, 8, 1, 75-83.new window
Johnson, L. A., and Montgomery, D. C. 1974, Operations research in production planning, scheduling, and inventory control, New York: John Wiley.
Jones, C. H., 1967, ”Parametric production planning,” Management Science, 13, 11, 254-267.
Khoshnevis, B., Wolfe, P. M. and Terrell, M. P., 1982, "Aggregate planning models incorporating productivity - An overview," International Journal of Production Research, 20, 5, 555 - 564.
Khoshnevis, B., Wolfe, P. M. and Terrell, M. P., 1983, "An aggregate planning model incorporating dynamic productivity: part 1, model development," IIE Transactions, 15, 111 - 118.new window
Kubo, M., and Kasugai, H., 1987, “Multi-period inventory vehicle routing problem,” Waseda Daigaku Rikogaku Kenkyusho Hokoku/Bulletin of Science and Engineering Research Laboratory, 118, 19-26.
Lee, C. Y., 1993, “The multi-product warehouse location problem: Applying a decomposition algorithm,” International Journal of Physical Distribution & Logistics Management, 23, 6, 3-13.
Lee, S. M. and Moore, L. J., 1974, "A practical approach to production scheduling problem," Production and Inventory Management, 15, 1, 79-92.new window
Leung, J., and Yu, A., 2002, “Quota allocation by linear programming using a spreadsheet solver,” Asia - Pacific Journal of Operational Research, 19, 1, 63-70.new window
Lisboa, J., and Yasin, M., 1999, “The impact of workforce level restriction on the performance of the linear decision rule: an exploratory production planning study,” Industrial management Data systems, 99, 4, 156-158.
Love, Jr. R., 1981, “Traffic scheduling via Benders decomposition,” Mathematical Programming Study, 15, 102-124.
Magnanti, T. L., and Vachani, R., 1990, “A strong cutting plane algorithm for production scheduling with changeover costs,” Operations Research, 38, 456-473.
Magnanti, T. L., Mireault, P., and Wong, R. T., 1983, “Tailoring Benders decomposition for un-capacitated network design,” Mathematical programming Study, 26, 112-154.
Marin, A., and Salmeron J., 1998, “Electric capacity expansion under uncertain demand: decomposition approaches,” IEEE Transactions on Power Systems, PWRS-13, 2, 333-339.
Martin, R. K., 1999, Large scale linear and integer optimization, Kluwer Publishing Company.
McCahon, C. S., 1987, Fuzzy set theory applied to production and inventory control, Ph. D. Dissertation, Department of Industrial Engineering, Kansas State University.
Nadira, R., Lebow, W. M., and Usoro, P. B., 1987, “Decomposition approach to preventive planning of reactive volt ampere source expansion,” IEEE Transactions on Power Systems, PWRS-2, 1, 72-77.new window
Oliff, M. D., Lewis, H. S., and Harkland, R. E., 1989, "Aggregate planning in crew-loaded production environments," Computers & Operations Research, 16, 1, 13-25.new window
Ozdamar, L., and Barbarosoglu, G., 1999, “Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem,” Journal of Operational Research Society, 50, 8, 810-825.
Pereira, M. V. F., and Pinto, L. M. V. G., 1983, “Application of decomposition techniques to the mid-and short-term scheduling of hydrothermal systems,” IEEE Transactions on Power Apparatus and Systems, PAS-102, 11, 3611-3618.
Peterson, R., and Silver, E. A., 1979, Decision systems for inventory management and production planning, New York: John Wiley & Sons.
Pinto, J. M., and Grossman, I. E., 1994, “Optimal cyclic scheduling of multistage continuous multiproduct plants,” Computers Chemical Engineering, 18, 9, 789-816.
Polyak, B. T., 1967, “A general method of solving extremum problem (in Russian),” Doklady Akademii Nauk SSSR, 174, 1, 33-36 [English translation: Soviet Mathematics Doklady, 8, 593-597].new window
Reeves, G. R., Lawrence, K. D., Lawrence, S. M., and Gonzalez, J. J., 1988, "A multiple criteria approach to aggregate industrial capacity expansion,” Computers & Operations Research, 15, 4, 333-339.
Richardson, R., 1976, “Optimization approach to routing aircraft,” Transportation Science, 10, 1, 52-71.new window
Rinks, D. B., 1982, “The performance of fuzzy algorithm models for aggregate planning under differing cost structure,” Fuzzy Information and decision processes, M. M. Gupta and E. Sanchez (eds.), North-Holland Publishing Company, 267-278.
Rouhani, R., Lasdon, L., Lebow, L., and Waren, A. D., 1985, “A generalized Benders decomposition approach to reactive source planning in power system,” Mathematical Programming Study, 25, 62-75.
Sahinidis, N.V., Grossmann, I. E., and Chathrathi, M., 1989, “Optimization model for long range planning in the chemical industry,” Computers Chemical Engineering. 13, 9, 1049-1063.
Sandbothe, R. A., 1996, “User interactive heuristic procedure for solving the multiple product cycling problem,” Computer & Operational Research, 23, 9, 897-907.
Schrijver, A., 1986, Theory of linear and integer programming, Wiley-Interscience Publication.
Schroeder, R. G., and Larson, P. D., 1986, “A reformulation of the aggregate planning problem,” Journal of Operations Management, 6, 3-4, 245-256.
Sharifi, H., and Zhang, Z., 1999, “A methodology for achieving agility in manufacturing organizations: An introduction,” International Journal of Production Economics, 62, 1-2, 7-22.
Sharp, J. M., Irani, Z., and Desai, S., 1999, “Working towards agile manufacturing in the UK industry,” International Journal of Production Economics, 62, 1-2, 155-169.
Sherali, H. D., and Adams W. P., 1984, “A decomposition algorithm for a discrete location- allocation problem,” Operations Research, 32, 4, 878-900.
Shor, N. Z., 1962, ”Application of the gradient method for the solution of network transportation problem (in Russian),” Notes Scientific Seminae on Theory and Application of Cybernetics and Operations Research, Academy of Sciences of the Ukrainian SSR, Kiev.
Shor, N. Z., 1964, “On the structure of algorithms for the numerical solution of optimal planning and design problems (in Russian),” Dissertation, Cybernetics Institute, Academy of Sciences of the Ukrainian SSR, Kiev.
Tabucanon, M. T., and Mukyangkoon, S., 1985, “Multi-objective Microcomputer- based interactive production planning,” International Journal of Production Research, 23, 5, 1001-1023.
Taubert, W. H., “A search decision rule for the aggregate scheduling problem,” Management Science, 14, 6, February 1968, B343-B359.
Tersine, R. J., 1980, Production/ Operation management: concepts, structure, and analysis, New York: North Holland.
Van De Panne, C., and Bosje, P., 1962, “Sensitivity analysis of cost coefficient estimates: the case of linear decision rules for employment and production,” Management Science, 9, 82-107.
Van Roy, T. J., 1986, “A cross decomposition algorithm for capacity facility location,” Operations Research, 34, 1, 145-162.new window
Vergin, R. C., 1966, "Production scheduling under seasonal demand,” Journal of Industrial Engineering, 260-266.
Wagner, H. M. and Whitin, T. M., 1958, "Dynamic version of the economic lot size model," Management Science, 5, 89-96.
Wang R. C., Fang H. H., 2001, “Aggregate production planning with multiple objectives in a fuzzy environment,” European Journal of Operational Research, 133, 521-536
Watkins Jr, W. and Mckinney, C., 1998, “Decompositions methods for water resources optimization models with fixed costs,” Advances in Water Resources, 21, 283-295.
Wolsey, L. A., 1997, “MIP modeling of changeovers in production planning and scheduling problems,” European Journal of Operational Research 99, 154-165.
Wu, T. H., Huang, K. I., and Chen W., 1995, “Optimal scheduling plan for a coal shipment problem: an efficient approach,” Computers and Engineering, 29, 1-4, 489-493.
Yellen, J., Al-khamis, T.M., Vemurl, S., and Lemonidis, L., 1992, “A decomposition approach to unit maintenance scheduling,” IEEE Transactions on Power Systems, PWRS-7, 2, 726-732.
Yusuf, Y. Y., Sarhadi, M., and Gunasekaran, A., 1999, “Agile manufacturing: The drivers, concepts and attributes,” International Journal of Production Economics, 62, 1-2, 33-43.
Zangwill, W. I., 1966, "A deterministic production scheduling model with backlogging," Management Science, 13, 1, 78-87.new window
Zhang, J., Gu, J., Li, P., and Duan, Z., 1999, “Object-oriented modeling of control system for agile manufacturing cells,” International Journal of Production Economics, 62, 1-2, 145-153.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE