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


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


    題名: Solving the parallel batching with machine preventive maintenance in Flexible Job Shop scheduling problem when minimizing makespan and total tardiness
    作者: 施政延;Shi, Zheng-Yan
    貢獻者: 工業管理研究所
    關鍵詞: 彈性零工式排程問題;局部搜索;預防性維護;flexible job shop scheduling;preventive maintenance;local search
    日期: 2023-07-20
    上傳時間: 2024-09-19 14:38:21 (UTC+8)
    出版者: 國立中央大學
    摘要: 這個研究討論的彈性零工式排程問題有許多限制。我們的研究與一般的彈性零工式排程問題的不同之處在於考慮了機器預防性維護和操作並行分批。在處理完工序後,機器上會產生堆積物。如果堆積物累積達到上限,機器就需要進行預防性維護,以清潔和保養機器。我們提出了一種解決這個雙目標排程問題的演算法。該演算法的初始族群可以通過隨機生成個體或部分利用可排程操作()來形成,並且考慮了新型操作限制,稱為機器預防性維護。我們提出了新的鄰域結構,用於處理堆積物和機器預防性維護。同時,我們提出了新的高效搜索策略,以找到更好的解決方案。目標是最小化兩個標準,即最小化總遲延和完成時間。;The flexible job shop scheduling problem discussed in this study has many restrictions. The difference between our research and the general flexible job shop scheduling problem is that the machine preventive maintenance and operation parallel batching has been considered. After processed operations, deposits will be generated on the machine. If the accumulation of deposits reaches the upper limit, the machine needs to do the preventive maintenance to clean and maintain the machine. We propose an algorithm for solving this bi-objective scheduling problem. The initial population of this algorithm is formed by either randomly generating individuals or partially generating them by utilizing schedulable operations (omega), and considered the new type operation constraint called machine preventive maintenance. The new neighborhood structure for deposits and machine preventive maintenance is proposed. The new and efficient search strategy is proposed to find a better solution. The objective is the minimization of two criteria, minimize the total tardiness and the makespan.
    顯示於類別:[工業管理研究所 ] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML19檢視/開啟


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