ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

An improved particle swarm optimization algorithm for flowshop scheduling problem

Zhang, Changsheng*; Sun, Jigui; Zhu, Xingiun; Yang, Qingyun中国科学院
INFORMATION PROCESSING LETTERS2008-10-31DOI: 10.1016/j.ipl.2008.05.010
30被引7阅读
引用收藏
分享

摘要

The flowshop scheduling problem has been widely studied and many techniques have been applied to it, but few algorithms based on particle swarm optimization (PSO) have been proposed to solve it In this paper, an improved PSO algorithm (IPSO) based on the "alldifferent" constraint is proposed to solve the flow shop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnate, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that the proposed IPSO algorithm is more effective and better than the other compared algorithms. It can be used to solve large scale flow shop scheduling problem effectively.

学科与关键词

关键词
Flow shop scheduling problemParticle swarm optimizationMakespanCombinatorial problems
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
INFORMATION PROCESSING LETTERS
发表日期
2008-10-31
卷期
第 108 卷, 第 4 期
页码
204-209
DOI
10.1016/j.ipl.2008.05.010
语言
ENGLISH
成果收录
SCIE

作者

  • Z

    Zhang, Changsheng (通讯) (第一作者)

  • S

    Sun, Jigui

查看全部 4 位作者收起作者
  • Z

    Zhu, Xingiun

  • Y

    Yang, Qingyun

    changchun inst opt fine mech & phys · chinese acad sci

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417