English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65317/65317 (100%)
Visitors : 21301934      Online Users : 180
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/76580

    Title: 近似求解機台可用區間限制求最小化總完工時間之平行機台排程問題;Approximation of Identical Parallel Machine Scheduling with Machine Availability Constraint to Minimize Total Completion Time
    Authors: 林志佳;Lin, Chih-Chia
    Contributors: 工業管理研究所
    Keywords: 平行機台;可用時間限制;總完工時間;近似解;動態規劃;Parallel Machine;Availability Constraint;Total Completion Time;Approximate Solution;Dynamic Programming
    Date: 2018-08-10
    Issue Date: 2018-08-31 11:28:41 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 在此研究中,我們探討n個不可被分割的工作以及m個平行機台的排程問題,針對每個機台具有不同數量的可用時間間隔限制的狀況,考慮最小化總完工時間。在多數的排程問題都沒有考慮可用時間間隔的限制,然而在實際情形上這種情形十分地常見,例如在製造業中,機台不可能一直處於運轉的狀態,會針對機台進行例行停機維護,以提升機台在生產時的良率及壽命。
    ;In this research, we discuss a scheduling problem including n non-preemptive jobs and m identical parallel machines with availability constraints. Our objective is minimizing the total completion time. . Most scheduling problems assume machines will work continuously, but in fact the situation is not always possible. So we consider the situation that each machine has its own available intervals For example, in the manufacturing industry, machines cannot always be in an operating state. Workers will stop the machines for a preventive maintenance period. It can keep the machines status stable and increase the yield of productions and the service life of the machines.
    To find out the approximation solution for our problem, we first develop a dynamic programming algorithm. We adopt the proposed schemes of Tsou.(2017) and Chen.(2016) which is/are based on the idea of scheduling. We used three propositions to eliminate the possibility which cannot lead to the optimal solutions. These propositions are compared by the starting time and the number of jobs which are assigned in the available intervals filled up with jobs. Finally, we compare our dynamic programming with the branch and bound algorithm proposed from Tsou(2017).
    Appears in Collections:[工業管理研究所 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

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