English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 11475727      Online Users : 103
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  A Branch-and-Bound Algorithm to Solve the Equal-Execution-Time Job Scheduling Problem with Precedence Constraint and Profile


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80815


    Title: A Branch-and-Bound Algorithm to Solve the Equal-Execution-Time Job Scheduling Problem with Precedence Constraint and Profile
    Authors: Yang, C. I.;Wang, J. S.;Lee, R. C. T.
    教師: 李家同
    Date: 1989
    Publisher: Elsevier
    Relation: COMPUTERS & OPERATIONS RESEARCH, Elsevier, Volume 16, Issue 3, 1989, Pages 257-269
    Keywords: Branch-and-Bound
    Algorithm
    Equal-Execution-Time Job Scheduling Problem
    Abstract: Dolev and Warmuth proposed a dynamic programming approach with time complexity O(nh(m−1) +1), where n is the total number of jobs, h is the height of the job precedence graph and m is the breadth of the time profile, to solve the same problem. In this paper, we introduce a branch-and-bound method to solve this problem. The performance of a branch-and-bound algorithm in general, tightly depends on the branching rules and bounding conditions. Therefore we suggest five strategies for the branching and bounding rules to reduce the number of nodes traversed in the solution tree. Some of them are heuristic rules and the others are terminating rules. The behavior of these strategies is discussed. Testing results show that our algorithm is better than Dolev and Warmuth's approach.
    Relation Link: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80815
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML574View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback