中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/59941
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 78937/78937 (100%)
造访人次 : 39182653      在线人数 : 448
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/59941


    题名: 以啟發式演算法解決三機流程式生產排程問題-以先豐通訊IC載板廠為例;Flowshop of three machines production scheduling improve research Using Meta-heuristics - for example Company BTK
    作者: 李坤源;Lee,kun-yuan
    贡献者: 工業管理研究所在職專班
    关键词: 限制理論;非等效平行機台;機台合適度;啟發式演算法
    日期: 2013-06-13
    上传时间: 2013-07-10 11:49:59 (UTC+8)
    出版者: 國立中央大學
    摘要: 本研究針對流程型、非等效平行機台、機台合適度、製程相依及製程獨立設置時間的生產排程問題進行探討並考量求解目標為 : 最小化加總成本(ΣCj)及加總?對延遲時間。
    本研究針對個案工廠實際的生產工單組合進行分析,先?用限制理論把全線的排程問題限縮在前段有製程設置時的三個工作站,再針對這三站的製程特性進行個別分析,再把問題範圍縮小到—非等效平行機台、有機台合適度、產能平衡、設置時間議題的綠漆工作站,為全線的產能瓶頸站,並利用限制驅導式排程及Permutation的觀念,以綠漆站的排程當做投料排程來簡化全線的生產排程問題。再利用Excel內建的啟發式演算法做求解的工具,但因Excel的限制再並需再將α= P2類型的排程先,以人工的方法將工單分成兩類使排程問題又從P2再簡化為1(1*2 , 1R / 1S)。
    本研究先建構一個評估個案工廠排程績效的數學模式,運用個案實際的工單資料為測試基礎,再以SPT、EDD、LST三種派工法則及個案現行的人工排程方法與Excel內建的啟發式演算法,做排程績效之評估比較,結果發現Excel內建的啟發式演算法在換線成本項目的績效上有10 ~ 43% 的提昇,但在加總?對延遲時間項目的改善上則不顯著。

    This study explores the production scheduling problems of Floor Shop, Unrelated Parallel Machine, Machine Eligibility, Sequence Dependent Setup Time and Sequence Independent Setup Time and also attempts to solve the following research question: the minimization of ΣCj & ΣTj.
    This study also analyzes the combinations of run card in the case-study factory through the following procedures. First, confine the problems of the whole workstations scheduling to the three working stations with anterior section of having setup time process by means of TOC. Next, implement the independent analysis of the process feature in these three stations, and then further restrict the problems to a certain Solder musk working station, featuring Unrelated Parallel Machine, Machine Eligibility, Balance of Capacity and Setup Time Issue, which is the bottleneck station in the production line. Then, with the concept of D-B-R, simplify the problems of production scheduling in the whole line by assimilating the scheduling in Solder musk station into goods issue scheduling. Finally, use the Meta-heuristics built in the Excel as the means of instruments.
    This study begins with a mathematical module to evaluate the performance of effects in the case-study factory and uses the authentic data of run card as the test foundation. Then, activate the comparison of performance of effects by means of three Dispatching Rules – SPT, EDD, and LST, artificial scheduling, as well as the Meta-heuristics built in the Excel. The result demonstrates 10 to 43 percent of improvement in the item of cost of setup calculated by the Meta-heuristics built in the Excel. However, there is no significant improvement in the item of ΣTj.
    显示于类别:[工業管理研究所碩士在職專班 ] 博碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML1011检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明