| DC 欄位 |
值 |
語言 |
| DC.contributor | 工業管理研究所 | zh_TW |
| DC.creator | 洪崇賓 | zh_TW |
| DC.creator | Chung-pin Hung | en_US |
| dc.date.accessioned | 2007-7-21T07:39:07Z | |
| dc.date.available | 2007-7-21T07:39:07Z | |
| dc.date.issued | 2007 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=944206017 | |
| dc.contributor.department | 工業管理研究所 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 在此研究中，我們考慮當極小化最大延遲時間時，在機器合適度限制與變動機器維修時間下，n個不可分割的工作和m台平行機台的排程問題。每台機器累積一段工作時間後必須進行維修以確保作業正確性，每個工作也只能被安排在某些特定的機器上‧進行機器維修的時間點並未固定，在給定機台最大連續工作時間下，決定何時進行維修‧
在極小化最大延遲時間的目標式下，首先我們將允許工作切割的排程問題，利用網路流技術轉變成最大流量問題；接著我們提出一個演算法其結合網路流技術與二元搜尋法尋找其問題的最佳解；最後，將結果作為分支界限法的下界，求取不允許工作切割排程問題的最佳解‧
實驗的分析顯示，分支界限法所產生的節點數比例非常小，顯示提出的淘汰法則強而有力‧我們的演算法能用於12個工作和5台機器問題下而得到一個最佳解。 | zh_TW |
| dc.description.abstract | In this paper we consider the problem of scheduling n independent and non-preemptive jobs into m parallel machines with eligibility constraints and variable machine maintenance intervals while minimizing the maximum lateness. Each machine is not always available for processing and should be shut down for maintenance to prevent malfunction. Each job is only allowed to be processed on a specific machine set. The maintenance of machine is not a fixed time interval known in advance, and the length of each interval is restricted to the given maximum continuously processing time.
To minimizing the Lmax firstly, we utilize a network flow technique to formulate the scheduling problem of the preemptive jobs into a series of maximum flow problems. Then, we propose an algorithm which combines a network flow technique and a binary search procedure to solve the problem optimally. Finally, we use the result of the preemptive scheduling problem as the lower bound of the proposed branch and bound algorithm to get the optimal solution of the study problem.
Computational analysis shows that the effectiveness of eliminating rules proposed is powerful and very low percentage of nodes is generated by the branch and bound algorithm. Our algorithm can get the optimal solution for the problem with up to 12 jobs and 5 machines. | en_US |
| DC.subject | 機器可用時間限制 | zh_TW |
| DC.subject | 平行機台 | zh_TW |
| DC.subject | 網路流 | zh_TW |
| DC.subject | 分枝界限法 | zh_TW |
| DC.subject | 機器維修工作 | zh_TW |
| DC.subject | 機器合適度限制 | zh_TW |
| DC.subject | parallel machine | en_US |
| DC.subject | Network flow | en_US |
| DC.subject | branch and bound | en_US |
| DC.title | 考量機台維修與機器何適度限制之平行機台排程問題 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Scheduling the Jobs and Maintenance Activity on Parallel Machines with Eligibility Constraints | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |