English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 78728/78728 (100%)
造訪人次 : 33543572      線上人數 : 491
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/11129


    題名: 雙機流程型生產環境下加權提早與延遲成本最小化之排程問題;Two-Machine Flow Shops Scheduling to Minimize Job Independent Earliness and Tardiness Penalties with a Given Common Due Date
    作者: 徐士凱;Shih-Kai Hsu
    貢獻者: 工業管理研究所
    關鍵詞: 雙機流程型生產;分支界限法;交期;提早與延遲成本;排程;Two-machine flow shops;Scheduling;Earliness and tardiness penalties;Due date;Branch-and-bound algorithm
    日期: 2005-06-30
    上傳時間: 2009-09-22 14:14:33 (UTC+8)
    出版者: 國立中央大學圖書館
    摘要: 本研究探討雙機流程型生產環境下加權提早與延遲成本最小化之排程問題。在這篇論文中,我們假設有多個工作它們有共同的交期要加工,權重是根據這個工作是提早或延遲完工來決定。本論文提出一個分支界限法求得一多產品之加工順序、最小加權提早與延遲成本。而我們也針對提出的分支界限法進行實驗和資料分析,用以驗證演算法的正確性和效率。 This study deals with the two-machine flow shops scheduling problem with the consideration of earliness and tardiness penalties. There are multiple jobs with a given common due date to be scheduled. All jobs have equal earliness and tardiness weights, and the weight of a job depends on whether the job is early or late, which are job-independent. The objective is to find a schedule that minimizes the weighted sum of earliness and tardiness penalties. We propose a number of propositions and revised Bagchi’s algorithm as a lower bound, which are implemented in our branch-and-bound algorithm to eliminate nodes efficiently in the branching tree. We also conduct computational analysis to show the validation and the effectiveness of our algorithm compared with enumeration.
    顯示於類別:[工業管理研究所 ] 博碩士論文

    文件中的檔案:

    檔案 大小格式瀏覽次數


    在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 ©   - 隱私權政策聲明