政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75477
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 114404/145434 (79%)
造访人次 : 53197601      在线人数 : 454
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/75477


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/75477


    题名: New particle swarm optimization algorithm for makespan minimization in permutation flowshop sequencing
    作者: Chen, Tingyu;Chen, Chuenlung
    陳春龍
    贡献者: 資訊管理學系
    关键词: Makespan;Makespan minimization;New particle swarm optimization;Permutation flow shops;Permutation flowshop scheduling problems;PSO algorithms;Random keys;Scheduling algorithms;Particle swarm optimization (PSO)
    日期: 2009-12
    上传时间: 2015-06-01 17:24:42 (UTC+8)
    摘要: Particle Swarm Optimization (PSO) is a new type of heuristic inspired by the flocking behavior of birds. This paper presents a Particle Swarm Optimization (PSO) to solve the permutation flowshop scheduling problem (PFSP) objectives, to minimize the makespan. To this end, we have proposed the use of discrete PSO algorithm for the position of the smallest value (SPV) to use a random key representation of Bean [Baena Bean, Genetic algorithms and random keys sequencing and optimization, Orsa calculated Journal 6 (2) (1994) 154-160]. In the proposed algorithm, the particle and the velocity re-defined and effective way to develop a series of new particles. In addition, we analyzed the characteristics of the elite jobs in the proposed algorithm. The results showed that the idea really follows the approach of PSO. © 2009 IEEE.
    關聯: 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009,868-871
    数据类型: conference
    DOI 連結: http://dx.doi.org/10.1109/ICICIC.2009.278
    DOI: 10.1109/ICICIC.2009.278
    显示于类别:[資訊管理學系] 會議論文

    文件中的档案:

    没有与此文件相关的档案.



    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈