English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23237309      Online Users : 744
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/11191


    Title: 在具機器可用時間與機器合適度限制之平行機台排程問題下運用分枝界限法尋求最佳解;Branch and Bound Algorithm for Parallel Machine Scheduling with Availability and Eligibility Constraints
    Authors: 林正峰;Cheng-Feng Lin
    Contributors: 工業管理研究所
    Keywords: 排程;網路流;平行機台;分枝界限法;服務水準限制;合適度限制;可用時間限制;Scheduling;network flow;branch and bound;parallel machine;availability constraint;service level constraint;eligibility constraint
    Date: 2006-06-27
    Issue Date: 2009-09-22 14:16:01 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 在此研究中,我們考慮當極小化最大延遲時間時,在具機器可用時間與機器合適度限制下,n個不可分割的工作和m台平行機台的排程問題。每台機器只有某些時間區段可以被安排處理工作,每個工作也只能被安排在某些特定的機器上,每個工作和機器上的每個可用的時間區段都有特定的服務水準,而只有當這個時間區段的服務水準高於或等於工作的服務水準時,此工作才能被安排在這個時間區段內。 我們提出一個分枝界限法去尋找這個問題的最佳解。首先,網路流技術用來闡述可分割工作的排程問題並將其轉變成最大流量問題。然後,我們提出一個演算法其結合網路流技術和二元搜尋法去找到其問題的最佳解,並將其結果作為我們的下限。最後,我們提出五個支配的法則來提升分枝界限法的效率。 實驗的分析顯示,所提出的淘汰法則是非常強而有力的並且在分枝界限法中只有非常小的比例的節點被產生。我們的演算法能用於20個工作和7台機器問題下而得到一個最佳解。 In this paper we consider the problem of scheduling n non-preemptive jobs on m identical machines with machine availability and eligibility constraints when minimizing the maximum lateness. Each machine is not always available for processing and each job is only allowed to be processed on specific machines. Each job and availability interval of machines has a specific service level. Each job has to be processed at availability interval with the service level specified or higher one. We propose a branch and bound algorithm to find out the optimal solution of this problem. Firstly, network flow technique is used 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 find an optimal solution for the problem and use this result as our lower bound. Finally, we propose five dominance rules to increase the efficiency of the branch and bound algorithm. 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 20 jobs and 7 machines.
    Appears in Collections:[工業管理研究所 ] 博碩士論文

    Files in This Item:

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