English  |  正體中文  |  简体中文  |  Items with full text/Total items : 25444/26039 (98%)
Visitors : 6437813      Online Users : 382
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.ksu.edu.tw/handle/987654321/5816


    Title: Multi-constraint system scheduling using dynamic and delay ant colony system
    Authors: Shih-Tang Lo (羅仕堂)
    Ruey-Maw Chen
    Yueh-Min Huang
    Keywords: ant colony optimization
    scheduling
    multiprocessor
    Date: 2007-06
    Issue Date: 2009-11-18 12:26:09 (UTC+8)
    Abstract: This study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system, with two designed rules, called dynamic and delay ant colony system, is proposed to solve the scheduling problems. The dynamic rule is designed to modify the latest starting time of jobs and hence the heuristic function. A delay solution generation rule in exploration of the search solution space is used to escape the local optimal solution. Simulation results demonstrate that the proposed modified ant colony system algorithm provides an effective and efficient approach for solving multiprocessor system scheduling problems with precedence and resource constraints.
    Appears in Collections:[資訊管理系所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Multi-constraint System.pdf188KbAdobe PDF86View/Open


    All items in KSUIR are protected by copyright, with all rights reserved.


    本網站之所有圖文內容授權為崑山科技大學圖書資訊館所有,請勿任意轉載或擷取使用。
    ©Kun Shan University Library and Information Center
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback