English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 10566915      Online Users : 20266
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/121535


    Title: A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX
    Authors: Chen, S. H.
    Date: 2014-12
    Issue Date: 2021-10-21 12:11:43 (UTC+8)
    Abstract: In Rabadi et al. [9], they studied the single machine scheduling problem with setup cost in the common due date environment. Their research assumed the static state when it comes to the problem of single machine scheduling. However, in reality, the dynamic arrival time exists in the scheduling problems. It means unknown numbers of jobs arrive successively. To solve this new scheduling problems on single machine, this research will take Inver-Over [10] as the basis of Inver-over CX. The proposed algorithm combines two-point intersection PMX (Partial Message Crossover). The experimental result shows that the new method, Inver-over CX is better than Inver-over because the proposed algorithm overcomes the slow convergency of inver-over operator.
    Relation: Proceedings of the 8th International Conference on Bioinspired Information and Communications Technologies, p.36-42
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML81View/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