Lakehead University Library Logo
    • Login
    View Item 
    •   Knowledge Commons Home
    • Electronic Theses and Dissertations
    • Retrospective theses
    • View Item
    •   Knowledge Commons Home
    • Electronic Theses and Dissertations
    • Retrospective theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    quick search

    Browse

    All of Knowledge CommonsCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDisciplineAdvisorCommittee MemberThis CollectionBy Issue DateAuthorsTitlesSubjectsDisciplineAdvisorCommittee Member

    My Account

    Login

    Empirical study of dense schedule performance ratio on open-shop scheduling problem

    Thumbnail
    View/Open
    YanQ2006m-1b.pdf (1.428Mb)
    Date
    2006
    Author
    Yan, Qingxiang
    Metadata
    Show full item record
    Abstract
    In this paper, we study properties of dense schedules for the open-shop problems and their average performance ratio. After using two sets of test problems, we show that the average performance ratio of dense schedules is actually much better than ( ), the worst-case performance ratio in the conjecture. The results from randomly generated problems which have large sizes show that when the dimension of open-shop problems become larger, the average performance ratio is getting even smaller. Twelve heuristic algorithms to generate dense schedules are presented in Chapter 3 and the computational results of two sets of test problems are also provided.
    URI
    http://knowledgecommons.lakeheadu.ca/handle/2453/3687
    Collections
    • Retrospective theses [1605]

    Lakehead University Library
    Contact Us | Send Feedback

     

     


    Lakehead University Library
    Contact Us | Send Feedback