English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64191/96979 (66%)
Visitors : 8153419      Online Users : 7664
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121480


    Title: Bi-Variate Artificial Chromosomes with Genetic Algorithm for Single Machine Scheduling Problems with Sequence-Dependent Setup Times
    Authors: Chen, S. H.;Chen, M. C.
    Keywords: ACGA;Bi-Variate EDAs;Scheduling Problems;Sequence-Dependent Setup Times;Common Due-Date
    Date: 2011-06-05
    Issue Date: 2021-10-14 12:13:14 (UTC+8)
    Publisher: IEEE
    Abstract: Artificial chromosomes with genetic algorithm (ACGA) is one of the latest Estimation of Distribution Algorithms (EDAs). This algorithm has been used to solve different kinds of scheduling problems successfully. However, due to its proba bilistic model does not consider the variable interactions, ACGA may not perform well in some scheduling problems, particularly the sequence-dependent setup times are considered because a former job influences the processing time of next job. It is not sufficient that probabilistic model just captures the ordinal information from parental distribution. As a result, this paper proposes a bi-variate probabilistic model added into the ACGA. The new algorithm is named extended artificial chromosomes with genetic algorithm (eACGA) and it is used to solve single machine scheduling problem with sequence-dependent setup times in a common due-date environment. Some heuristics are also employed with eACGA. The results indicate that the average error ratio of eACGA is one-half of the ACGA. In addition, when eACGA works with other heuristics, the hybrid algorithm achieves the best solution quality when it is compared with other algorithms in literature. Thus, the proposed algorithms are effective for solving this scheduling problem with setup consideration.
    Relation: Proceeding of Congress of Evolutionary Computation 2011, p.45-53
    DOI: 10.1109/CEC.2011.5949596
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Bi-Variate Artificial Chromosomes with Genetic Algorithm for Single Machine Scheduling Problems with Sequence-Dependent Setup Times.pdf295KbAdobe PDF3View/Open
    index.html0KbHTML60View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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