English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92721/123073 (75%)
Visitors : 26952076      Online Users : 316
RC Version 6.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
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/73498
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/73498


    Title: A revised discrete particle swarm optimization algorithm for permutation flow-shop scheduling problem
    Authors: 陳春龍
    Chen, Chun-Lung;Huang, Shin-Ying;Tzeng, Yeu-Ruey;Chen, Chuen-Lung
    Contributors: 資管系
    Keywords: Permutation flow-shop scheduling problem;Particle swarm optimization;Makespan
    Date: 2013-12
    Issue Date: 2015-02-12 14:19:38 (UTC+8)
    Abstract: This research proposes a revised discrete particle swarm optimization (RDPSO) to solve the permutation flow-shop scheduling problem with the objective of minimizing makespan (PFSP-makespan). The candidate problem is one of the most studied NP-complete scheduling problems. RDPSO proposes new particle swarm learning strategies to thoroughly study how to properly apply the global best solution and the personal best solution to guide the search of RDPSO. A new filtered local search is developed to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from premature convergence. Computational experiments on Taillard’s benchmark problem sets demonstrate that RDPSO significantly outperforms all the existing PSO algorithms.
    Relation: Soft Computing,18(11),2271-2282
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1007/s00500-013-1199-z
    DOI: 10.1007/s00500-013-1199-z
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    2271-1187.pdf456KbAdobe PDF1126View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback