政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/35201
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113318/144297 (79%)
造访人次 : 51103668      在线人数 : 922
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 >  Item 140.119/35201


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/35201


    题名: 實際零工式生產派工法則之選擇：靜態系統
    作者: 鄧紫文
    Teng , Tzu-wen
    贡献者: 陳春龍
    Chen , Chuen-Lung
    鄧紫文
    Teng , Tzu-wen
    关键词: 派工法則
    排程
    零工式生產
    dispatching rules
    scheduling
    jobshop
    日期: 2003
    上传时间: 2009-09-18 14:25:45 (UTC+8)
    摘要: 現今企業在面臨市場需求快速變化、接單多樣化，及交貨期短的多重壓力下， 無不致力於改善作業流程以求獲利極大化，尤其是現場生產排程規劃一直是相當複雜而難以管理的部分。現行的軟體例如：企業資源規劃(ERP)、供應鏈管理(SCM)，即是希望藉由資訊科技以解決複雜的生產排程問題。
    然而，大部分企業在使用這些系統時都發現，由於缺乏有效的現場管制功能(Shop Floor Control)，使得這些系統的效能受到很大的限制，而目前大多數的現場排程問題為零工式生產問題(Job Shop Problem)。
    過去在零工式生產問題的理論上雖有許多傑出的研究，但研究與現場實際的問題之間有許多差異。其中最大的差異在於過去研究所使用的零工式生產問題假設所有的工作會以不同的流程經過所有的機器，然而在現場實際的零工式生產問題中卻顯示每一機器所處理的工作數目變異非常大。現場零工式生產生產排程問題包括兩個主要特性：1、每一工件可以擁有不等之操作數目；2、事先知道某些機器為瓶頸機器。本研究分別針對此兩個特性設計實驗一：產生工件擁有’等操作數’與’不等操作數’的問題；與實驗二：’無瓶頸機器’與’有瓶頸機器’的問題。在實驗中，我們以三個因素：工件數、機器數、和操作時間變異，模擬產生18種不同的狀況。然後以7種評量準則比較50個常用的派工法則在不同狀況下的表現。
    研究結果發現，在實驗一與實驗二中，理論與實際現場排程問題在派工法則的表現上確實有極大的差異。本研究將這些其差異加以分析，並嘗試整理出一些規則以提供現場的使用者在面對不同狀況下選擇適當之派工法則的依據。我們相信本研究的成果不論對理論研究者、現場工程師、或生管軟體系統開發者都有極大價值。
    參考文獻: 英文文獻：
    1. Allahverdi, A. and Tatari, M. F., 1996, “Simulation of different rules in stochastic flowshops,” Computers and Industrial Engineering, Vol. 31(1/2), 209-212.
    2. Baker, C.T. and Dzielinski, B.P.,1960. Simulation of a simplified job shop. Management Science,6:311-323
    3. Baker, K. R., and Kanet, J. J., 1983, “Job shop scheduling with modified due dates,” Journal of Operations Management, Vol. 4(1), 11-22.
    4. Baker, K.R.,1974,Introduction to Sequencing and Scheduling. Wiley, New York.
    5. Barrett R. and Kadipasaoglu,S.N.,1999. “Evaluation of Dispatching Rules in a Dynamic Flow Shop”,Producion and Inventory Management Journal,31:1,54-58
    6. Blackstone, J.H., Phillips, D.T., and Hogg, G.L.,1982. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res.,20:27-45
    7. Chang, F. C. R., 1996, ”A study of due-date assignment rules with constrained tightness in a dynamic job shop,” Computer and Industrial Engineering, Vol. 31(1/2), 205-208.
    8. Conway, R.W., 1965. Priority dispatching and job lateness in a job shop. J. Ind. Eng., 16:228-237
    9. Day J.E., Hottenstein, M.P., 1970. Review of sequencing research. Naval Research Logistics Quarterly 17,11-39
    10. Graham, R.L., et al., 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling : a Survey”, Ann. Discrete Math, 5, 287-326
    11. Haupt, R., 1989. A survey of priority rule-based scheduling. OR Spektrum,11:3-16
    12. Holthaus,O.,1997.”Design of Efficient Job Shop Scheduling Rules”, Computer &industrial Engeneering Vol 33 Nos 1-2.247-252
    13. Holthaus,O.,1999.”Scheduling in job shops with machine breakdowns:an experimental study”,Computer &industrial Engeneering Vol 36,137-162
    14. Holthaus,O.,Rajendran,C ,2000. “A study on the performance of scheduling rules in buffer-constrained dynamic-flowshops” International Journal of Production Research, vol. 40, no. 13, 3041-3052
    15. Holthaus,O.,Rajendran,C ,2000. Efficient jobshop dispatching rules:further developments. Production Planning & Control Vol11 NO.2, 171-178
    16. Holthaus,O.,Rajendran,C 1997. Efficient dispatching rules for scheduling in a job shop. International journal of production economics 48,87-105
    17. Holthaus,O.,Rajendran,C 1999. A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116,156-170
    18. Hunsucker, J. L. and Shah, J. R., 1994, “Comparative performance analysis ofpriority rules in a constrained flow shop with multiple processors environment,” European Journal of Operational Research, Vol. 72, 102-114.
    19. Liu, K. C., 1998, “Dispatching rules for stochastic finite capacity scheduling,”Computers and Industrial Engineering, Vol. 35(1), 113-116.
    20. 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 roport No.87
    21. Narasimhan, S. L., Mangiameli, P. M., 1987, “A comparison of sequencing rules for a two-stage hybrid flow shop,” Decision Sciences, Vol. 18, 250-265.
    22. Raghu and Rajendran,1993. An Efficient Dynamic Dispatching Rule for Scheduling in a Job Shop. Int. J. Prod. Econom.,32,301-313
    23. Raghu, T.S., Rajendran, C., 1993. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economic 32,301-313
    24. Russell, R.S., Dar-el, E.M., Taylor ΙΙΙ, B.W.,1987. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research 25,215-238
    25. Sarper, H. and Henry, M., 1996, “Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop,” Omega, Vol. 24(1), 73-81.
    26. 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, Vol. 6(4), 301-310.
    27. Wilbrecht, J.K. and Presscott, W.R., 1969. The influence of setup time on job shop performance. Management Science,16:274-280
    中文文獻：
    28. 陳建良，1995，「排程概述」，機械工業雜誌第12 月號，pp.122-137。
    29. 王治平，2003，實際零工式生產排程問題的派工法則，國立政治大學資訊管理研究所，碩士論文。
    描述: 碩士
    國立政治大學
    資訊管理研究所
    91356007
    92
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0091356007
    数据类型: thesis
    显示于类别:[資訊管理學系] 學位論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    35600701.pdf83KbAdobe PDF2889检视/开启
    35600702.pdf95KbAdobe PDF21405检视/开启
    35600703.pdf207KbAdobe PDF21448检视/开启
    35600704.pdf416KbAdobe PDF21413检视/开启
    35600705.pdf374KbAdobe PDF21076检视/开启
    35600706.pdf1021KbAdobe PDF21028检视/开启
    35600707.pdf223KbAdobe PDF21169检视/开启
    35600708.pdf131KbAdobe PDF2881检视/开启
    35600709.pdf2634KbAdobe PDF21006检视/开启
    35600710.pdf82KbAdobe PDF2690检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 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 ©   - 回馈