政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/35185
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113822/144841 (79%)
造訪人次 : 51796613      線上人數 : 241
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 >  Item 140.119/35185


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/35185


    題名: 實際零工式生產排程問題的派工法則
    Dispatching Rules for Practical Job Shop Scheduling
    作者: 王治平
    貢獻者: 陳春龍 教授
    王治平
    關鍵詞: 派工法則
    排程問題
    零工式工廠
    日期: 2002
    上傳時間: 2009-09-18 14:23:15 (UTC+8)
    摘要: 由於製造業在生產的過程中常常面對複雜的排程計畫以及現場的不確定狀況，使其在應用ERP或SCM系統時，因缺乏有效的現場管制功能而無法發揮這些系統的整體效能。因為排程問題是現場管制系統的核心，尋找有效且快速求解排程問題的方法是開發現場管制系統成敗的關鍵。過去十年間，針對零工式生產排程問題的研究上已有許多傑出的成果，但我們發現過去研究中所使用的零工式生產排程問題與現場實際的問題之間有許多差異，因此這些研究成果並無法完全由現場所使用。
    本研究所強調之現場零工式生產排程問題包括兩個主要特性：1、每一工件可以擁有不等之操作數目，2、事先知道某些機器為瓶頸機器。這是相對於過去研究中的零工式生產排程問題皆假設每一工件會使用每一機器，因此其所產生的問題將使每一工件擁有相等之操作數，且每一機器的重要性皆相等。針對這兩個主要差異，本研究設計兩個實驗：實驗一產生工件擁有’等操作數’與’不等操作數’的問題；實驗二產生現場’無瓶頸機器’與’有瓶頸機器’的問題。在每一實驗中，我們以三個因素：機器使用率、交期設定和操作時間變異，模擬產生12種不同的狀況。然後以7種評量準則比較16個常用的派工法則在不同狀況下的表現。
    研究結果發現，在’不等操作數’以及’有瓶頸機器’的生產排程問題中，派工法則的表現確實與其在’等操作數’以及’無瓶頸機器’的問題中的表現有極大的差異。本研究將這些其差異加以分析，並嘗試整理出一些規則以提供現場的使用者在面對不同狀況下選擇適當之派工法則的依據。我們相信本研究的成果不論對理論研究者、現場工程師、或生管軟體系統開發者都有極大價值。
    參考文獻: 1.陳建良，1995，“排程概述”，機械工業雜誌，12月，頁122-137。
    2.麥昭仁，1996，“晶圓製造廠主要機種派工法則之設計“，國立交通大學工業工程研究所，碩士論文。
    3.Appold, S. J., Harrison, B., and Kelley, M. R., 1993, “Spatially proximate inter-organizational networks, agglomeration economics, and technological performance in U.S. manufacturing,” Annual meeting of the association of American geographers.
    4.Allahverdi, A. and Tatari, M. F., 1996, “Simulation of different rules in stochastic flowshops,” Computers and Industrial Engineering, 31(1/2), pp. 209-212
    5.Baker, C. T. and Dzielinski, B. P., 1960, “Simulation of a simplified job shop,” Management Science, Vol. 6, pp. 311-323.
    6.Baker, K. R., and Kanet, J. J., 1983, “Job shop scheduling with modified due dates,” Journal of Operations Management, 4(1), pp. 11-22.
    7.Baker, K. R., 1984, “Sequencing rules and due-date assignments in a job shop,” Management Science, 30(9), pp. 1093-1104.
    8.Ballakur, A., and Steudel, H. J., 1984, “Integration of job shop control systems: a state-of-the-art review,” Journal of Manufacturing Systems, Vol. 3, pp. 71-79.
    9.Barrett R. and Kadipasaoglu, S. N. 1999, "Evaluation of Dispatching Rules in a Dynamic Flow Shop", Production and Inventory Management Journal, 31:1, pp.: 54-58..
    10.Blackstone, J.H., Philips, D.T. and Hogg, G.L., 1982, “A state-of-the-art survey of dispatching rules for manufacturing job shop operations,” International Journal of Production Research, Vol. 20, pp. 27-45.
    11.Chang, Yih-long, Sueyoshi, T., and Sullivan, R. S., 1996, “Ranking dispatching rules by data envelopment analysis in a job shop environment,” IIE Transactions, Vol. 28, pp. 631-642.
    12.Conway, R. W., 1965, “Priority dispatching and work-in-process inventory in a job shop,” Journal of Industrial Engineering, Vol. 16, pp.123-130 and pp. 228-237.
    13.Conway, R. W., et al., 1967, "Theory of Scheduling", Addison-Wesley.
    14.Dar-El, E. M., and R. A. Wysk. 1982. “Job Shop Scheduling - A Systematic Approach,” Journal of Manufacturing Systems, Vol. 1, pp. 77-88.
    15.Elvers, D. A., 1974, “The sensitivity of relative effectiveness of jobshop dispatching rules with respect to various arrival distributions,” IIE Transactions, 6(1), pp. 41-49.
    16.Graham, R.L., et al., 1979, "Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey", Ann. Discrete Math, 5, pp.287-326.
    17.Haupt, R., 1989. “A survey of priority rule-based scheduling,” OR Spektrum, Vol.11, pp. 3-16.
    18.Herrmann, J. W., 2001, "Improving Manufacturing System Performance through Rescheduling", Computer Integrated Manufacturing Laboratory, University of Maryland, June 21
    19.Hershaner, J. C., and Ebert, J., 1975, “Search and simulation selection of a job-shop scheduling rule,” Management Science, Vol. 21, pp. 53-63.
    20.Hertz, A. and Widmer, M., 1996, "An improved tabu search approach for solving the job shop scheduling problem with tooling constraints," Discrete Applied Mathematics, 65, pp.319-345.
    21.Holthaus, O., Rajendran, C., 1997. “Efficient dispatching rules for scheduling in a job shop,” International Journal of Production Economics, Vol. 48, pp.87-105.
    22.Jain, A. S. and Meeran S., 1998, "A State-of-the-Art Review of Job-Shop Scheduling Techniques", Technical Report, Department of Applied Physics, Electronic and Mechanical Engineering University of Dundee, Dundee, Scotland, UK.
    23.Hunsucker, J. L. and Shah, J. R., 1994, “Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment,” European Journal of Operational Research, 72, pp. 102-114
    24.Liu, K. C., 1998, “Dispatching rules for stochastic finite capacity scheduling,” Computers and Industrial Engineering, 35(1), pp. 113-116.
    25.Montazeri, M., and Van Wassenhove, L. N., 1986, “Scheduling rules for manufacturing systems,” Working paper 86-01, Afdeling Industrial Beleid, K. U. Leuvan, Leuyen, Belgium.
    26.Nanot, Y. R., 1963, “An experimental investigation and comparative evaluation of priority disciplines in job-shop-like queueing networks,” Management Sciences Research Project, UCLA, Research report No.87.
    27.Narasimhan, S. L., Mangiameli, P. M., 1987, “A comparison of sequencing rules for a two-stage hybrid flow shop,” Decision Sciences, Vol. 18, pp. 250-265.
    28.Parunak, H. V. D., 1991, "Characterizing the Manufacturing Scheduling Problem", Journal of Manufacturing Systems, Vol. 10, pp.241-259.
    29.Pinedo, M., 1995, “Scheduling Theory, Algorithms, and Systems,” Prentice Hall, New Jersey.
    30.Rajendran, C., Holthaus, O., 1999. “A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116, pp. 156-170.
    31.Rajendran, C. and Holthaus, O., 1999, “A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116, pp. 156-170.
    32.Ramasesh, R., 1990, “Dynamic job shop scheduling: a survey of simulation research,” Omega, 18(1), pp. 43-57.
    33.Sadeh N., 1991, "Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling", Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
    34.Sarper, H. and Henry, M., 1996, “Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop,” Omega, 24(1), pp. 73-81.
    35.Stecke, K. E., and J. J. Solberg. 1981. “Loading and Control Procedures for Flexible Manufacturing Systems,” International Journal of Production Research, No. 19, 481-490.
    36.Waikar, A. M., Sarker, B. R. and Lal, A. M., 1995, “A comparative study of some priority dispatching rules under different shop loads,” Production Planning & Control, 6(4), pp. 301-310.
    37.Wilbrecht, T. J. and Presscott, W. R., 1969. “The influence of setup time on job shop performance,” Management Science, Vol. 16, pp. 274-280.
    38.Yang, S. and Wang, D., 2000, "Constraint Satisfaction Adaptive Neural Network and Heuristics Combined Approaches for Generalized Job-Shop Scheduling", IEEE Transactions on Neural Networks, Vol. 11, No. 2, March, pp.474-486.
    描述: 碩士
    國立政治大學
    資訊管理研究所
    90356013
    91
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0090356013
    資料類型: thesis
    顯示於類別:[資訊管理學系] 學位論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    35601301.pdf38KbAdobe PDF21015檢視/開啟
    35601302.pdf39KbAdobe PDF2987檢視/開啟
    35601303.pdf41KbAdobe PDF21138檢視/開啟
    35601304.pdf46KbAdobe PDF21215檢視/開啟
    35601305.pdf49KbAdobe PDF21428檢視/開啟
    35601306.pdf73KbAdobe PDF264603檢視/開啟
    35601307.pdf70KbAdobe PDF21955檢視/開啟
    35601308.pdf427KbAdobe PDF21452檢視/開啟
    35601309.pdf27KbAdobe PDF2853檢視/開啟
    35601310.pdf50KbAdobe PDF21509檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋