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

An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

Zhang Su-jun; Gu Xing-sheng*华东理工大学
Journal of Central South University2015-9DOI: 10.1007/s11771-015-2887-x
15被引3阅读
引用收藏
分享

摘要

An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers (IBFSP) in order to minimize the maximum completion time (i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy (IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.

学科与关键词

关键词
discrete artificial bee colony algorithmflow shop scheduling problem with intermediate buffersdestruction and constructiontournament selection
相关
加载中…
  • Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem
    Han, Yu-Yan*; Liang, J. J.; Pan, Quan-Ke; Li, Jun-Qing; Sang, Hong-Yan; Cao, N. N.INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 67(1-4): 397-414.被引 38
  • A discrete artificial bee colony algorithm with composite mutation strategies for permutation flow shop scheduling problem
    Li, X.; Yin, M.*Scientia Iranica, 2012, 19(6): 1921-1935.被引 35
  • A DISCRETE BUTTERFLY-INSPIRED OPTIMIZATION ALGORITHM FOR SOLVING PERMUTATION FLOW-SHOP SCHEDULING PROBLEMS
    Qi, X.*; Yuan, Z.; Han, X.; Liu, S.Neural Network World, 2020, 30(4): 211-229.被引 2
查看全部 →

发表信息

论文状态
公开发表
期刊
Journal of Central South University
发表日期
2015-09
卷期
第 22 卷, 第 9 期
页码
3471-3484
DOI
10.1007/s11771-015-2887-x
语言
ENGLISH
期刊收录
SCIE
期刊等级
Q3
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61174040, 61104178, 61374136]; Shanghai Commission of Science and Technology, China [12JC1403400]; Fundamental Research Funds for the Central Universities, China

作者

  • Z

    Zhang Su-jun (第一作者)

    e china univ sci & technol · henan inst sci & technol

  • G

    Gu Xing-sheng (通讯)

    e china univ sci & technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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